NVM

there are a lot of primes under $$$200000$$$, somewhere about $$$10^4$$$, so your code is running for $$$10^4*10^5 = 10^9$$$ operations. hint: for each number find its factorization

IMO it's pretty brute,but still,Not every prime is needed you just need some prime.all the prime factors from lcm of first two numbers will suffice.second thing is you could use log(n) prime factorisation. Next thing you could notice is second minimum power of all this primes after prime factorisation of each number in array will contribute to answer.link to my submission for reference