Thanks for the kata!
Current description plus test cases do not give a possibility to solve it the first time though (at least in Python).

@lechevalier Thank you for your time. I appreciate that. Got the point. =)

=)

I've added some test case. Try to count factorial(1500) using your solution. ;)

Usage of string.translate() manages the task much faster than join().

Thanks for a clear and accurate solution. Great move using get()! :)

Is there sense to use try/except instead of if/else in this case?

Could you please tell where the "seq" appeared from? I can't see or it's just late hour to blame. :)

You're an advance one-liner solution person. :)

With all due respect it can't be the best practice.
If you used two for loops for parsing the list the x index should start from i+1 position and the stop index for the i should be len(numbers)-1.
And you should not type 0 as a start point in range() because it's used by default:

for i in range(len(numbers)-1):
    for x in range(i+1, len(numbers)):

Though, using two for loops are far from fast solution for this kata.

Very fast solution indeed. Could someone explain the trick, please? Are there any possible exceptions or inaccuracies?

I love when such math correlations are found. Great solution.

Kata is solved. So, nevermind. =)

The largest number of katas I could not solve (at least on the first try and it did take some time to improve an approach and coding skills to give it a try again after a while) is for katas from g964. A crazy stuff for me. =)