These are the amounts of time required to factor semiprimes. Semiprimes are numbers that are 
generated by multiplying two prime numbers together. This project is not about testing 
cryptography, but rather about testing the time complexity of the second most simple factoring 
algorithm. This is a public server and the time complexity appears to be slightly above 
exponential as the bits increase linearly. The numbers written will be the semiprime, the two 
factors of the semiprime, and the number of seconds required to compute. The CPU time is limited 
to roughly 1/6 (exactly 17%) using cpulimit. Output:

9991
97 * 103
0
50621
223 * 227
16
102941
311 * 331
605
150463
379 * 397
3387
200623
439 * 457
9558
249919
491 * 509
20679
301337
541 * 557
37862