tag:blogger.com,1999:blog-6881326265222951171.post6439955367309512104..comments2011-05-20T11:53:35.926+02:00Daniel Niggebruggehttp://www.blogger.com/profile/02053201958307619797noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-6881326265222951171.post-19843957798345494632010-06-27T17:53:05.008+02:002010-06-27T17:53:05.008+02:00Are you using C++? If so, ypu might try the new std::tr1::unordered_set it's been in boost now for many years as boost::unordered_set. It averages O(1) and I've used it to test millions of hashes at once in 16crack. It's more than twice as fast as a sorted binary_search. Here's a screenshot: http://16systems.com/16crack/pc.pngBradhttp://16systems.com/16crack/pc.pngnoreply@blogger.comtag:blogger.com,1999:blog-6881326265222951171.post-73106860870101395312009-10-02T13:37:58.196+02:002009-10-02T13:37:58.196+02:00Can i download it anywhere?Anonymousnoreply@blogger.com