The feeling I had wracking my brain to solve this only to find the top solution was near exactly what I had come up with :')

oh my good 'o'

oh my god, anyone else could never achieve such level of code. brilliant!

wow that's really clever! and so much less code than what I had!

holy moly

pep-8?

If I'm not mistaken, I think it compares the ascii or unicode number for it. '4' in ascii would be int 52 and '5' would be int 53, '6' is int 54 and so forth so anything below int 53, put a '0' and anything above put a '1'

and he sacrificed the space complexity!

wowza

nice

I wrote this same code except last line

However, it's worth noting that this implementation iterates through the array three times in the best case (once for sum(), once for max(), and once for min()), which could be a consideration for very large arrays where performance is critical.Maybe your solution was even better in the end ;)

intresting it just compiled all the 4-5 lines of code to a one liner (but, i'm being honest here it can be optimised)...
REGARDLESS, GOOD JOB