The Redditer in me perhaps is impressed, the Y is disappointed that it offers no real insight.
t = n / m / 86400 / P
n: search space (no of possible passwords)
m: amount of random passwords that can be tested a second
86400: 60*60*24 (converts units to days)
P: parallelism (number of crackers)
Let n = 12401769434657526912139264
m = 100
P = 1,000,000
It would only take 143 days to be successful. Is this correct? Second question, how do we carve up the search space and distribute this to the internet?