I tried using Ramanujan's factorial formula (as it was supposed to give me the result without iteration or recursion) but that too didn't help. So as you suggested, there is another way to calculate the number of trailing zeros without finding the factorial. Will try that.

All my test cases pass and I get this error :

Help!!

Test Results:
✔ Test Passed
✔ Test Passed
✔ Test Passed
✔ Test Passed
✔ Test Passed
✔ Test Passed
STDERR:
Traceback:
in
in zeros
MemoryError

Why does it fail for : only tneserp with srettel the and the or tsisnoc dedulcni will same be takes word

It should return : only present with letters the and the or consist included will same be takes word

But error is shown.