This is just humble bragging but I have a prime factorization algol that will factor up to a 52 bit product of any two primes in under 16s average on an i3, no gpu, and constant space requirements. This is without memoization/caching, or rainbow tables. It's not numerically stable after 52bits owing to hardware precision limitations but I'm looking at means to effectively route around the issue.