we wrote such dupefinders as fun hackathon contest organized by the dallas perl user group 2013:<p><a href="http:&#x2F;&#x2F;perlmonks.org&#x2F;?node_id=1067570" rel="nofollow">http:&#x2F;&#x2F;perlmonks.org&#x2F;?node_id=1067570</a><p>discussion at <a href="http:&#x2F;&#x2F;mail.pm.org&#x2F;pipermail&#x2F;dfw-pm&#x2F;2013-December&#x2F;thread.html" rel="nofollow">http:&#x2F;&#x2F;mail.pm.org&#x2F;pipermail&#x2F;dfw-pm&#x2F;2013-December&#x2F;thread.htm...</a><p>=&gt; <a href="http:&#x2F;&#x2F;dfw.pm.org&#x2F;winners.html" rel="nofollow">http:&#x2F;&#x2F;dfw.pm.org&#x2F;winners.html</a><p>it is really not easy. I used as only one bloom hashes, which explains why mine was fastest and smallest, but unfortunately not correct.