Now the problem is how to efficiently compute s(p^e), but this itself is not too difficult

If e = 1 then s(p^e) = p
If e = 2 then s(p^e) = m, where m has at least 2 factors of p, so we need only check if multiples of p factorial are divisible by p^e, and this gives us a very quick way to calculate

However, the problem was not as simple as I thought, this method alone quickly gives an answer for 10^6, but is still much too slow for 10^8. After about 3 attempts at making it as fast as possible I managed to get the answer in ~230 seconds, which is still too slow. I did this by generating all the primes less that 10^8, and then storing all s(p^e) in an array and then using that array to sieve the rest of the numbers.

I believe I can sieve everything in one go, instead of essentially doing it twice, to vastly increase the speed.