Just renaming result to steve_wins and l to total_non_ties could do it much easier.

Hello. The problem is you can't just compare directly, as alphabetical order isn't equal ranking here, as 'T' < 'J' is False.

The best one!

Is it somewhat more performant than a "default" (simple join) solution?
Like, it applies limit only on the first subquery, so there is no need to watch the whole customer's table.

Yep, I was confused by making bad experiment.

I tried on range(10)[1:5] -> >>> range(1, 5) - returns something not because range is just generator but because it returns object that support supsbcirping (or how it calls).

On

def yielder():
  yield 'yeet'

or simpler (elm for elm in 'yeet')[1:3]

returns TypeError: 'generator' object is not subscriptable

Sory for delay.
So, like it seems natural that it's about all ants, but where is the end of the right hand side? Is it will be that last platfform as in -...-.-? Also The terrain never starts or ends with a gap it doesn't matter then is terrain ends with gap or not. I'm not native English speaker and maybe it's just my fault yet maybe we need something like additon in braces until all the ants reach the right hand side (solid ground with enough space for all ants).

OMFG!!! That isn't obvious, I spend 2 days solving it thinking that we should return state as ants stops at right end of terrain.

Yep, will read task descriptions more careful next time.

Oh, for real. But at least you have got a ratinal seed from my question)

If the final result is longer than 140 chars it must return false.

There is some code that tests for length result after applying .replace(' ', ''). So add to test cases with multiple spaces that exceed 140 limit.