Data structure to store objects identified by unique 8digit hexadecimals for fast insertion and lookup

I have a bunch of objects with unique 8 digit hexadecimal identifiers ex[fd4786ac] that I need to construct and look up quickly. Deletion is not a priority. These hexadecimal values are currently being stored as strings.

Considered a trie(or some variation of a trie), a skip list, and a some variation of a hash table. Using a skip list over a AVL tree would be preferable since it is likely these strings will be sequential but not guaranteed and tree re-balancing would be often. How ever I'm open to other data structures if they better suit my need.

A good choice would be to convert your keys into 32-bit integers, and then use a hash table.

If you want to write your own just for this use case, then:

• Instead of hashing keys all the time or storing hash values, use a bijective hash function and use the hashes instead of the keys.
• Since your keys are very small you should probably use open addressing -- it will save space and it's a little faster. Wikipedia will give you lots of choices for probing schemes. I currently like robin hood hashing: https://www.sebastiansylvan.com/post/robin-hood-hashing-should-be-your-default-hash-table-implementation/