Roy Johnson,
It's fixed, now.

Mostly. It gives the number instead of 1 if the number is prime. That really isn't a big deal.

$ time ./rjnew.pl
real    1m8.446s
user    1m1.338s
sys     0m0.440s
[download]

So you have a couple of the fastest implementations. The Inline::C is only barely winning though that might be static. The interesting thing is that many solutions are faster than using Math::Pari to get a list of factors and doing a binary search.