Good to know that some katas have performance requirements, looking forward to reach those.

I've added a comment to the github issue. I wouldn't be so quick to claim it is impossible, this is a platform made by coders for coders after all :)

Sorting makes it a N*LogN solution, while it can be done in N.

Sorting isn't cheap. Isn't there a way to evaluate the efficency of a solution?

Actually, I think there is room for this feature.
I see that when I submit a solution, it is timed!
Therefore, the calculated time could be attached to the submitted solution, and when listing the solutions you could sort them by time.
In any case, I would greatly appreciate such a feature.
As I understand correctly, I could write a terribly inneficient solution and still pass the kata?
If so, I think I prefer other sites so that I get pushed to write efficient solutions.

Hi, I'm new here.
In some of the competing websites, they give you a sense of how efficient your solution is.
I assume they run it against a very large N and time it, compare the time to other solutions, etc.
From the first couple of problems I solved on the site, it didn't seem to have that feature.
Does it depend on the excercice itself? Or is there no such feature (yet)?