Hashmaps are resistant against timing attacks, while binary searches are not.

With possible timing attacks you usually do a full linear search, without early return. This search has always constant time, twice as slow. When the attacker gets to know the seed somehow even hashmaps can be exploited.