Question

I am looking for a hash-algorithm, to create as close to a unique hash of a string (max len = 255) as possible, that produces a long integer (DWORD).

I realize that 26^255 >> 2^32, but also know that the number of words in the English language is far less than 2^32.

The strings I need to ‘hash’ would be mostly single words or some simple construct using two or three words.

---

The answer:

One of the FNV variants should meet your requirements. They’re fast, and produce fairly evenly distributed outputs. (Answered by Arachnid)

---

Answer 1

See here for a previous iteration of this question (and the answer).