4 ms·

I wonder if they'll also fix dictionary implementation to be O(1)* instead of O(n) * actually hash lookups are O(inverse ackerman) but that's kind of silly