Well this is very clever and an extremely fast O(1) solution, but it may not be obvious to most people what this giant line of computation is doing, so probably it's not very clear. Took me about 45 seconds to realise what it was doing and then I thought "oh wow thats amazing how come I didnt think of that..."

Wow I didn't know what a deque was, I'm guessing it's some sort of a circular list?

..... what?

Thanks for the nicely documented code

Thank you for this explanation!!

chill out bro no need to whip out that assembly

The power of mathematics, this is why maths is important in programming :((

That's often the case with clever solutions

I don't get it ._.

str(i) is well, a string, and so it's already iterable, no need for a list()

I'm such an idiot....

Arbitrary precision is fine and all, but the best method is to just avoid the mess of floating point numbers using formulas.
But this is insanely clever!

interesting

Every solution I've seen in here is O(n^2), safe to say I don't think there's a better way of doing it (You're calling qsort() once and then bsearch() on every iteration, not sure whether that's O(n^2) or not tbh)

Nice use of complicated C standard functions!