Could you give me test #10?
I made an algorithm which runs in O(n*logn*logn)which gives the same results as the trivial one (sort for suffix array and then comparing every two adjacent O(n^3)), but it doesn't pass this test, while the previously mentioned trivial one does (it gets stuck at #29). I supose I have some kind of trivial error, so it would be rather helpfull.