2 ms·
we wrote such dupefinders as fun hackathon contest organized by the dallas perl user group 2013: http://perlmonks.org/?node_id=1067570 http://perlmonks.org/?no
by rurban 11y ago
we wrote such dupefinders as fun hackathon contest organized by the dallas perl user group 2013:
http://perlmonks.org/?node_id=1067570 http://perlmonks.org/?node_id=1067570
discussion at http://mail.pm.org/pipermail/dfw-pm/2013-December/thread.html http://mail.pm.org/pipermail/dfw-pm/2013-December/thread.htm...
=> http://dfw.pm.org/winners.html http://dfw.pm.org/winners.html
it is really not easy. I used as only one bloom hashes, which explains why mine was fastest and smallest, but unfortunately not correct.