Nice!

too slow

a brilliant reduction!

Thank you :)

I like Number() better, it's clearer and easier to read

I guess because it's more comprehensive and declarative.

Can you explain me what returning this keyword refers in the program?

A-Well-a everybody's heard about the bird!
Bird bird bird, b-bird's the word.

Why python decides to tiebreak on their own is beyond me.

Wow, that's genius. I tried to use regex but had no idea how. Thanks man!

I figured someone would make a mathy solution that doesn't involve loops or recursion. Impressive. I wonder if it's faster than the other methods?

return heap[-1]?
Just realized although a sorted list is a heap, the reverse is not true. So have to use max(heap) here.