nothing to change, that's an exploit of cw's plateform itself.
To anyone tempted: don't use it unless you're ok to get banned.

Sometimes the constant factor is important when it's really performance-critical.

For example, heap sort and merge sort typically has a much bigger constant runtime factor than quick sort.

the simplification is valable/usefull for comparisons only if you compare different "degrees of complexity"

O(2n) == O(n)

O(2N) while it's easy to do it in O(N)...

I'm not good on Python. Please waiting the translator to fix it.
You got a few honors, but lost a lot of fun ;-)