In this problem, the test case measuring the time complexity has a pattern (the values are 1 smaller than the previous one). So you can pass this case by passing these values at the beginning of the program even your program does not have the efficient algorithm (time comp > O(n))

So, in my opinion, if the time complexity is an issue for this problem, at least one test case should be added to measure the algorithm really has the asked efficiency.