Some of these are so difficult!

...to debug.

There are examples with hyphens included, to show how non-alphabetical characters affect the results.

Okay, I see. You'd just like examples with the more complex cases shown.

The instructions are complete. This line covers exactly what you're talking about--perhaps you missed it?

A "word" is a sequence of alphabetical characters. By this definition, any other character like a space or hyphen (eg. "elephant-ride") will split up a series of letters into two words (eg. "elephant" and "ride").

I'm not sure what you mean. Which parts aren't clear? What specifically would you add?

The input is 111. You can't argue with that because that's the 4th fixed test.

Unless you've already did something to the input number before printing it...

No, because the input is 111.

Have you actually checked your input, like, at all? Please don't ask dumb questions that can be checked effortless on your side, printing the input is like a 8kyu thing.

(Also, even in that case, the closest square would be 100.)

Because its one of the test cases

That's not the input, that's what you've returned. Check your input.

well spotted. Completely ahuely.

+1 for Ruby.

Thank you for your input @sogr. I checked your solution and it looks different from others. I did not know the way you did could match the expected result.
So it is a good learning to me. You can see solution from the others because you have already solved it.

It's messy because people use lots of different characters :) Much better than ASCII, imo

@mentalplex: and how messy Unicode can ever be in general? ;-)

I see you've solved it. Congratulations! The key thing to learn from this is how many Unicode characters there actually are.