My implementation is O(n). (I also used Rust.) I would like to see the computation time (would be nice if they printed this in the Submissions table).

Is there any way to expose this information?

A comparison with other people on the leaderboard might be nice too—with like-for-like language comparisons. Not to rank people, but just as useful indicator of "how optimal" one's implementation is and whether it is comparable.

Is it a good idea to use it for my teslaquery blog, I have been running a startup related to tesla and i'm asking for it. Thanks

Thanks for giving this code as it has helped me alot in scaling the covers of cars that I am providing in my website nationalcarcovers.com . National Car Covers is go-to destination for high-quality, affordable car protection. I also suggesst to invest in a cover today and give your car the care it deserves. Don't let weather and environmental factors take a toll on your vehicle – trust National Car Covers to keep it looking and performing its best.

Python3 solution

# Enter your code here. Read input from STDIN. Print output to STDOUT
c, m, n = map(int,input().split())
if n == 1:
    print("0")
else:
    arr = [0 for i in range(2 * n + 2)]
    arr[0] = 0
    arr[1] = c
    l = []
    for i in range(2, 2 * n + 2):
        arr[i] = (arr[i - 1] + arr[i - 2]) % m
    for i in range(2, 2 * n - 2, 2):
        temp = (arr[i] * arr[i + 2] + arr[i + 1] * arr[i + 3]) % m
        l.append(temp)
        temp=(arr[i] * arr[i + 4] + arr[i + 1] * arr[i + 5]) % m
        l.append(temp)
    temp = (arr[2 * n - 2] * arr[2 * n] + arr[2 * n - 1] * arr[2 * n + 1]) % m
    l.append(temp)
    l = set(l)
    print(len(l))

Our game is a wonderful example of beauty. pgslot