Yes, this repetitive process makes it a slow solution.

I upvote for clever, but terribly slow.

line 7 and 8 are totally random, i was just making an experiment.
suddenly, it did not time out.
i deleted those, and again I was out of time. and then accidentaly I submitted this...

this will work until the data inside the brackets appears.

don't worry, you're not responsible in any way (well, almost x) )

;)

sorry about that, i was just happy i found a solution under a minute. now i see it is not the fastest one..

you're not missing anything, except noobs upvoting this solution ;)

O(N²)...

krasava

I believe there is a wrong message while failing tests. The ordering of the words, it says "{correct_result} should equal {wrong_result}", like in this case: 'LoBan wario hello' should equal 'LoBan wariohello'.

Before posting issues please look at the top of the page: 1007 people passed the Python kata so if there were errors several people would have seen them before you. Issues are for errors in the kata, not for problems in your code.

I am having a trouble with only a single test:
[13279649315191100, 2491547230640080] should equal [79677895891146600, 14949283383840400 ]
This seems to be some technical error, as if i divided both pairs, the results are almost indistinguishible: 5,32988062673793 vs 5,32988062673796.
But I'd rather not change my methodology (using modul Fractions) so I will create an exception.

Changing ranks is expensive, not worth it, and not going to happen. Just enjoy the cheap points.

Moreover, consider ranks are shared among languages and can vary a lot depending on each one.