I am getting TLE on last test case of this problem [Link to the problem](https://www.hackerrank.com/contests/projecteuler/challenges/euler048/problem), i used Big mod [Link to Big mod implmentation](https://www.geeksforgeeks.org/multiply-large-integers-under-large-modulo/) for multiplication while calculating power as we need last ten digits so we have to modulo it by 1e10 which will overflow in C++.↵
↵
Any type of help is appreciated. Thanks in advance.↵
↵
Any type of help is appreciated. Thanks in advance.↵