removed

I removed "unique" altogether

thank you so much

Your code is timing out. In the full tests, some of the arrays can get up to 10000+ elements long, and your code is doing too many iterations of the array (you have two different sets of nested loops, meaning you are doing roughly 2 * 10000 * 10000 iterations for an array with a length of 10000 which takes too long.) Your code needs to pass all tests in under 12 seconds, so you have to find a more efficient solution.

i cant attempt i tested and cant idk why.

done

Dude why would you console the solution?

This could've be one line code!

Why exactly sort runs "without this protocol"? Do you mean that sort does not iterate? sort does (an equivalent of) more iterations than two runs of max, does it not?

description should be language agnostic

Hi, I am uncertain of the author's objective for this task. In my opinion, it is essential to understand how tools function, and to comprehend their operation, one must be able to create them. Sorting is not appropriate for this task because we do not require a sorted list; we only need the two maximum values from the list. Sorting would be redundant.

What is the purpose of this kata? The sorting algorithm of Python is known to be efficient. Do you think that a workaround for this special situation is of any general use for the coder? In my opinion speed optimization katas like this one totally miss the point of what we learn at this challenge. Look at the ugliness of the solutions. Just to bend over backwards to avoid using the Python internals. :(

Hi, did you notice that I changed the time units to microseconds because sorting in Dart works quickly?