[racket] Bloom filter?

Hi,

I need to check whether a given string already occurs in a list of
several million strings, where occasional false positives are
acceptable.

Before reinventing the wheel, has anybody already implemented a
space-efficient Bloom filter in racket and would like to share it? 

Or, what else would you recommend?

Best,

Erich