1000 digits by leonid (based on flagitious)

N=624,u=1<<31,s[624],k,p=777;main(y){for(;++k<1624;)k<N?p=s[k]=1812433253*(p^p>>30&3)+k:putchar(((y=s[k%N]=s[(397+k)%N]^(p&u|(p=s[-~k%N])&~u)>>1)>>29^y>>22^y>>18^y>>14^y>>3^y)%2+48);}

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return to the top page