Don't compare apples to oranges. unordered_map is so slow because it has to guarantee pointer stability, doing seperate chaining, whilst the open addressing hashtables doing probing and moving do not. They are at least 2x faster.

Compare to linear probing, quadratic probing, double hashing, cuckoo, or swiss tables.