[Solved] Euler Project – Greatest prime factor computational power can’t handle my script [closed]
Following up on my suggestion in a comment – re-work your algorithm to reduce the amount of number crunching: #include <iostream> #include <math.h> int main() { const long long int num_in = 600851475143; long long int curr = num_in; while(true){ const long long int sr = static_cast<long long int>(sqrt(static_cast<long double>(curr))); long long int i = … Read more