Maybe, probably not thought as a completely naive solution to this problem an ar...

mamp · on July 19, 2015

You could get away with much less memory using Redis hashes with a few more lines of code: http://redis.io/topics/memory-optimization.

bpicolo · on July 19, 2015

I mean, a bloom filter isn't super difficult, but it's also probabilistic instead of deterministic.

_3u10 · on July 19, 2015

Exactly, so you'd need the array anyway...

Also, typically bloom filters don't come out of the box with the language you're using, so it's just more potential for bugs.

A lookup on a sorted array should take 8.6 comparisons anyway, I bet the hashing takes longer...

d_e_solomon · on July 19, 2015

That's true, good call.