This is all I used to solve the problem.

The basic structure of my code is as follows:

1. Sieve all the Totient and Möbius values, in arrays, phi_sieve, and mu_sieve

2. Pre-compute all modulo factorial values in and array factorial

3. Initialise a variable G = ∏ n^φ(n), n = 1 to 10^8

4. Notice that we can directly calculate G instead of calculating all g(n), therefore for each d, representing a divisor, we directly compute G. Therefore for d in range(2, 10^8):

   1. Initialise a common value which I call fac = factorial[d]/d^d, use modulo division as well

   2. Notice that for each number that d divides, there is no difference in fac, the only part that changes is μ(n/d), therefore we can directly sum all of the μ(n/d), for a given d. Let mu_total = sum of all μ(n/d)

   3. Then multiply G by fac^mu_total

5. Make sure to use modulo calculations everywhere to avoid overflow errors!

With this process we omit a lot of repeated calculations, we are able to solve the problem in less than an hour, below I list some test cases as the code is still a bit slow:

G(10^4) = 517055464,
G(10^5) = 516871211,
G(10^6) = 557051244,
G(10^7) = 623561178