Repository files navigation

C# implementation of Murmur Hash 2

Usage:

MurmurHash2.Hash("mystring");MurmurHash2.Hash(byteArray);

I wrote a small benchmark to test the number of collisions on a 466k words (list of all English words taken from here:https://github.com/dwyl/english-words) andthe number of collisions is 22 which I consider a pretty good result.

Standardstring.GetHashCode() gives48 collisions on the 466k word list.

Elapsed time (on the 466k word list):

On the numbers from1 to999999 (think ZIP codes) the results were:

GetHashCode is better with collisions here, but MurMur shines on longer texts.