There is not a test which really test if the submitted function is really does really solve the problem. here the "best" solution is a trivial function, submitted many times in order to reach the condition.

Elmar, I readily admit that this is a very easy problem.That's why it is in the "Cody5:Easy" section. There is code that will guarantee a correct solution, regardless of when you submit your entry. However, people going for the lowest possible Cody score will just keep submitting a low score entry until they hit the clock just right. There's really not a whole heck of a lot I can do about that.

Is there a way I can override the clock command used in the test case. Maybe freeze the clock and ignore the one in assert?