I naively applied suffix arrays with lcp and got AC in ~2.7s. (complexity N*K*log^2(K))

But I see that there are submissions with times <0.1s. What are the more efficient algorithms?

Someone mentioned suffix-function - any referece for that?
Also it was said that KMP can be used - can anyone explain how exactly it is applicable here?

Thanks in advance.