Code is c# running single threaded.
My largest test cases are the products of 5 and 6 digit primes. I can certainly put together larger test cases if you think it worth while.
A guesstimate of iterations required is roughly n/2. So RSA numbers are safe for a little bit.
There is one more efficiency I am looking into with regards to removing large chunks at the higher end of the remainder portion.