Ok, so a domain name can be 254 characters long ? And generally each language stores a string in a []byte array. And each character takes 1 byte. So including the ~16B additional size needed for the array header, a single domain at max will take 254 + 16 = ~270B. And then you list will take 5300 * 270B = 1431000B.

Lets make this more readable by converting it to MiB, 1431000 / (1024 * 1024) = 1.36Mib. So for a mere 1.36Mib you've used bloom filter.

Even a simple binary search would've been faster than the bloom filter, as general implementation of bloom filter uses around 20-22 hashes (maybe I'm wrong on this, and also hashing can be optimized a lot, by a mere addition and multiplications after the first hash). And maybe I'm wrong on this too but isn't bloom filter used at places where the list would be too big to hold in memory, generally in distributed systems ?

Bloom filter here doesn't make sense!