Hi, I was solving POP1 but can't get it to pass under the time limit.

Things I've tried. 1. For detecting pop numbers, I simply brute force. 2. For checking primes, I maintain an array of primes till 2e7 and after that apply Miller-Rabbin.

Here is my code.