Answer by kasperd for Tweetable hash function challenge
Python, 6446 6372 This solution achieves lower collision count than all previous entries, and it needs only 44 of the 140 bytes allowed for code: H=lambda s:int(s.encode('hex'),16)%16727401
View ArticleAnswer by Mr Public for Tweetable hash function challenge
Python, 9310 Yeah, not the best, but at least it is something. As we say in crypto, never write your own hash function. This is exactly 140 bytes long, as well. F=lambda...
View ArticleAnswer by Martin Ender for Tweetable hash function challenge
Mathematica, 6473 The next step up... instead of summing the character codes we treat them as the digits of a base-151 number, before taking them modulo 224. hash[word_] :=...
View ArticleAnswer by orlp for Tweetable hash function challenge
Python, 340053 A terrible score from a terrible algorithm, this answer exists more to give a small Python script that displays scoring. H=lambda s:sum(map(ord, s))%(2**24) To score: hashes = [] with...
View ArticleTweetable hash function challenge
In this code-challenge you will write a hash function in 140 bytes1 or less of source code. The hash function must take an ASCII string as input, and return a 24-bit unsigned integer ([0, 224-1]) as...
View Article