RSA-200: Factoring a 200DIGIT semiprime by GNFS

[1 DIGIT = log_2(10) bits ~ 3.3 bits]
From the following link:
http://en.wikipedia.org/wiki/RSA-200
"In mathematics, RSA-200 is one of the RSA numbers, large semiprimes that are part of the RSA Factoring Challenge."
"On May 9, 2005, F. Bahr, M. Boehm, J. Franke, and T. Kleinjung announced that they had factorized the number using GNFS as follows:
RSA-200 = 3532461934402770121272604978198464368671197400197625023649303468776121253679423200058547956528088349
* 7925869954478333033347085841480059687737975857364219960734330341455767872818152135381409304740185467"
"The CPU time spent on finding these factors by a collection of parallel computers amounted – very approximately – to the equivalent of 75 years work for a single 2.2 GHz Opteron-based computer."