> 85,000 unique identifiers (1.4Mb).

Basically all the data fit in the CPU cache, so what was being measured was mostly the number of steps needed for each algorithm.

For most real uses, the cache is a large part of the performance. If you are using the data in order, the trie may be faster because the next entry will likely already be cached. If you are using data in random order or doing other work in between lookups, the hashtable may be faster because it only has to fetch 1 or 2 lines into the cache instead of several.