Suggest your version of the correct code

Hermoso <3

not good. summing twice.

same l0l0l0l

i feel stupid

Unfortunely this is not a good solution, it's easy to implement, that's true but it's very slow. I tested it on a list of length 80 and k=6 and it took 188.6s whereas my solution took 1.77s

Totally agreed. But I also think that the context (expected range) where this code is used is important.

In a=b cases, the range is basically range object with one value. and sum function looks for values inside the range object (which in this case is just one value), and sums them up.

Please correct me if i'm wrong.

How does this code handle a = b cases? How does this return the value of a or b in such cases.

proper, neat, obvious....

Clear and concise! I love it. Much cleaner than my own.

no it doesn't

Nice one!

...except you still have to get the name's length, which is O(n) as well.