4 ms·With a perfect hash function. But it's still going to be closer to O(1) than O(log n)by learc83 9y agoWith a perfect hash function. But it's still going to be closer to O(1) than O(log n)