Bloom filters are very efficient, especially with low hit rates.

Speed, linear time behavior and low memory are major advantages. Disadvantages include a tunable rate of false positives and not telling which line did match.

Reimplement the algorithm using Bit::Vector if you need more speed.