Number of digits  When  Who  Notes 

16  ???  Legendre  
32  1887  Stieljes  Stieljes also computed z(k) for 2 £ k £ 70 to 32 decimal places. The computation permitted him to obtain
32 decimal places of the Euler constant g with the formula
g = 1log(3/2)(z(3)1)/3/4^{3}(z(5)1)/5/4^{5} ¼

520,000  1996  Greg Fee and Simon Plouffe  The computation was done
with a 64 bit experimental version of Maple with
formula (2).

1,000,000  1997  Bruno Haible and Thomas Papanikolaou  The computation took 8 hours on a HP 9000/712 machine.

10,536,006  1997, May  Patrick Demichel  The computation took 360 hours on a HP 9000/871 (160 Mhz) and used
a classical approach.

14,000,074  1998, Feb  Sebastian Wedeniwski  The computation took
53 h 22 min on 2 x UltraSPARC 200 MHz, 6 x Pentium II 233 MHz, 4
x Pentium 133 MHz

32,000,213  1998, Mar  Sebastian Wedeniwski  The computation took 35 h 21 min on 9 x MIPS R10000 180 MHz

64,000,091  1998, Jul  Sebastian Wedeniwski  The computation took 33 h on Power2 SC 135 MHz and PowerPC
604e 233 MHz

128,000,026  1998, Dec  Sebastian Wedeniwski  The computation took 39 hours 22 minutes on a 10 processor machine
(IBM S/390 G5 CMOS (9672RX6), ca 420 Mhz, 2 GB central storage,
14 GB expanded storage) from formula (3) with a
binary splitting approach. Verification was made with the same
formulae and a different
slitting process and different FFT, in two weeks on two machines
(IBM Power2 SC 135 MHz, 2 GB RAM and IBM PowerPC 604e 233 MHz, 1 GB
RAM).

200,001,000  2001, Sep  Shigeru Kondo and Xavier Gourdon  The
computation was launched by Shigeru Kondo with the program
PiFast40
written by X. Gourdon. Binary splitting method was used with two
different Zeilberger formulas.

600,001,000  2002, Feb  Shigeru Kondo and Xavier Gourdon  The
computation was launched by Shigeru Kondo with the program
PiFast41
written by X. Gourdon. Binary splitting method was used with formula
(2) and verified with Apery's formula. The computation
took 38 hours, verification took 200 hours.

1,000,000,000  2003, Feb  Patrick Demichel and Xavier Gourdon  The
computation was made with the program
PiFast42
and launched by Patrick Demichel. Apery's formula was used.
The verification was done with the same formula but with different
cutting parameters. The computation took 100 hours.
