Key bugs using a 32-bit signed int calculated using a fast hash

The hash algorithm is based on Java's String.hashCode

Code was taken from a response on StackOverflow:
http://stackoverflow.com/questions/7616461/generate-a-hash-from-string-in-javascript-jquery

This cut indexing time by 50% and index size by 20%.
Nothing is free though, and insert time is increased by 25%.

Inserting 1000 documents is still 6x faster than indexing them.