Divisors are found by using the prime factorization of the number. I'm using the same method to build an array of all primes below the input number as I used in the previous problem.

Divisors are found by using the prime factorization of the number. I'm using the same method to build an array of all primes below the input number as I used in the previous problem.

Note: the program depends on the following patch: https://github.com/orlp/golf-cpu/pull/8

Total cycles for examples: 19,474,982

Total cycles for examples: 29,566,640