post the coolest looking Obfuscated code

Obfuscated code = code purposely made more difficult.

dont dissapoint

perl -wle '(1 x $_) !~ /^(11+)\1+$/ && print while ++ $_'

>>2
bf doesn't count because it was retarded to begin with

javascript:(function(){for(;open('javascript:('+arguments.callee+')()'););})()

>>3
perl doesn't count because it was retarded to begin with

Python code for generating an ascii mandelbrot.

#Mandelbrot set
print (lambda Ru,Ro,Iu,Io,IM,Sx,Sy:reduce(lambda x,y:x+y,map(lambda y,
Iu=Iu,Io=Io,Ru=Ru,Ro=Ro,Sy=Sy,L=lambda yc,Iu=Iu,Io=Io,Ru=Ru,Ro=Ro,i=IM,
Sx=Sx,Sy=Sy:reduce(lambda x,y:x+y,map(lambda x,xc=Ru,yc=yc,Ru=Ru,Ro=Ro,
i=i,Sx=Sx,F=lambda xc,yc,x,y,k,f=lambda xc,yc,x,y,k,f:(k<=0)or(x*x+y*y
>=4.0) or 1+f(xc,yc,x*x-y*y+xc,2.0*x*y+yc,k-1,f):f(xc,yc,x,y,k,f):chr(
64+F(Ru+x*(Ro-Ru)/Sx,yc,0,0,i)),range(Sx))):L(Iu+y*(Io-Iu)/Sy),range(Sy
))))(-2.1, 0.7, -1.2, 1.2, 30, 80, 24)

>>6

You're a dipshit.  Eat some Python, since Perl is too hard for you.

#!/usr/bin/python
import re,os,cgi;d,h=os.listdir('.'),'<a href=wy?';p,e,g,s=tuple(map(cgi.parse().get,'pegs'));f=lambda s:reduce(lambda s,(r,q):re.sub('(?m)'+r,q,s),(('\r',''),('([A-Z][a-z]+){2,}',lambda m:('%s'+h+'e=%s>?</a>',h+'g=%s>%s</a>')[m.group(0) in d]%((m.group(0),)*2)),('^{{$','<ul>'),('^#
','<li>'),('^}}$','</ul>'),('(http:[^<>"\s]+)',h[:-3]+r'\1>\1</a>'),('\n\n','<p>')),s);o,g=lambda y:(y in d and cgi.escape(open(y).read()))or'',(g or p and[open(p[0].strip('./'),'w').write(s[0])or p[0]]or[0])[0];print'Content-Type:text/html\n\n'+(s and', '.join([f(n)for n in d if s[0]in o(n)])or'')+(e and'<form action=wy?p=%s method=POST><textarea name=s rows=8 cols=50>%s</textarea><input type=submit></form>'%(e[0],o(e[0]))or'')+(g and'<h1>%ss=%s>%s</a>,%se=%s>edit</a></h1>'%(h,g,g,h,g)+f(o(g))or'')

So removing the spaces and newlines is the best you fags can do? God you fail.

>>9
lambda expressions in python can't have newlines fag

>>10
Yeah, Python is crap, we all know that. But you kinda missed the point.

>>9 let me know when you understand why >>3 works.

bump

/*
* Program to compute an approximation of pi
* by Brian Westley, 1988
*/



#define _ -F<00||--F-OO--;
int F=00,OO=00;
main(){F_OO();printf("%1.3f\n",4.*-F/OO/OO);}F_OO()
{
_-_-_-_
_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_
_-_-_-_
}

>>14
I'm not sure of the value of this suggestion, but I'll make it anyway. It seems
the platform of the sonar sensor seems just about perfect for aiming
practically any type of sensor one might have. I have a book lying around on
Microwave Communications, and it has a chapter in it on amateur radar. What I
was thinking of was putting a Gunnplexer (10.525 GHz self-contained gunn diode
oscillator/downconverter) atop the stepper motor and building a sort of
microwave TI01, which will send a lower frequency signal to the Gunnplexer to
frequency modulate the outgoing beam, then when the modulated beam returns, it
will mix with the stable 10.525 GHz signal that exists normally in the resonant
cavity and produce an output signal from the mixer output. This of course could
be detected and interpreted by the replacement board and sent to the almost
unmodified software running on the PC. If we keep all else equal, one could
probably get a good 12 miles out of it, though it would not be particularly
accurate angularly or as to distance. The setup could, of course, be modified
to be more useful (using gears on the stepper motor, increasing the resolution
of the electronics, etc.) and one might be able to pick out individual
airplanes coming and going from the local airport. Who knows, we might even put
in Doppler interpretation! I'd like to hear what you (or anybody else, of
course) think of it.
 --( Alex

>>14
Output for gcc says 0.250

>>14
Too bad the series converges slow as fuck.

#!/usr/bin/perl -w                                      # camel code
use strict;

                                           $_='ev
                                       al("seek\040D
           ATA,0,                  0;");foreach(1..3)
       {<DATA>;}my               @camel1hump;my$camel;
  my$Camel  ;while(             <DATA>){$_=sprintf("%-6
9s",$_);my@dromedary           1=split(//);if(defined($
_=<DATA>)){@camel1hum        p=split(//);}while(@dromeda
 ry1){my$camel1hump=0      ;my$CAMEL=3;if(defined($_=shif
        t(@dromedary1    ))&&/\S/){$camel1hump+=1<<$CAMEL;}
       $CAMEL--;if(d   efined($_=shift(@dromedary1))&&/\S/){
      $camel1hump+=1  <<$CAMEL;}$CAMEL--;if(defined($_=shift(
     @camel1hump))&&/\S/){$camel1hump+=1<<$CAMEL;}$CAMEL--;if(
     defined($_=shift(@camel1hump))&&/\S/){$camel1hump+=1<<$CAME
     L;;}$camel.=(split(//,"\040..m`{/J\047\134}L^7FX"))[$camel1h
      ump];}$camel.="\n";}@camel1hump=split(/\n/,$camel);foreach(@
      camel1hump){chomp;$Camel=$_;y/LJF7\173\175`\047/\061\062\063\
      064\065\066\067\070/;y/12345678/JL7F\175\173\047`/;$_=reverse;
       print"$_\040$Camel\n";}foreach(@camel1hump){chomp;$Camel=$_;y
        /LJF7\173\175`\047/12345678/;y/12345678/JL7F\175\173\0 47`/;
         $_=reverse;print"\040$_$Camel\n";}';;s/\s*//g;;eval;   eval
           ("seek\040DATA,0,0;");undef$/;$_=<DATA>;s/\s*//g;(   );;s
             ;^.*_;;;map{eval"print\"$_\"";}/.{4}/g; __DATA__   \124
               \1   50\145\040\165\163\145\040\157\1 46\040\1  41\0
                    40\143\141  \155\145\1 54\040\1   51\155\  141
                    \147\145\0  40\151\156 \040\141    \163\16 3\
                     157\143\   151\141\16  4\151\1     57\156
                     \040\167  \151\164\1   50\040\      120\1
                     45\162\   154\040\15    1\163\      040\14
                     1\040\1   64\162\1      41\144       \145\
                     155\14    1\162\       153\04        0\157
                      \146\     040\11     7\047\         122\1
                      45\15      1\154\1  54\171          \040
                      \046\         012\101\16            3\16
                      3\15           7\143\15             1\14
                      1\16            4\145\163           \054
                     \040            \111\156\14         3\056
                    \040\         125\163\145\14         4\040\
                    167\1        51\164\1  50\0         40\160\
                  145\162                              \155\151
                \163\163                                \151\1
              57\156\056

>>16
Compile with --traditional-cpp, and use the one from http://www.catb.org/~esr/jargon/html/O/Obfuscated-C-Contest.html because >>14 can't copypasta for shit.

>>19
Blame the IOCCC founder Landon Curt Noll, because that's what it looks like on his site.
And blame me for being dumb enough to trust Noll to know HTML.

Let me try some BBCode formatting:


/*
 * Program to compute an approximation of pi
 * by Brian Westley, 1988
 * (requires pcc macro concatenation; try gcc -traditional-cpp)
 */

#define _ -F<00||--F-OO--;
int F=00,OO=00;
main(){F_OO();printf("%1.3f\n",4.*-F/OO/OO);}F_OO()
{
            _-_-_-_
       _-_-_-_-_-_-_-_-_
    _-_-_-_-_-_-_-_-_-_-_-_
  _-_-_-_-_-_-_-_-_-_-_-_-_-_
 _-_-_-_-_-_-_-_-_-_-_-_-_-_-_
 _-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
 _-_-_-_-_-_-_-_-_-_-_-_-_-_-_
 _-_-_-_-_-_-_-_-_-_-_-_-_-_-_
  _-_-_-_-_-_-_-_-_-_-_-_-_-_
    _-_-_-_-_-_-_-_-_-_-_-_
        _-_-_-_-_-_-_-_
            _-_-_-_
}

 

Note that this program works by computing its own area. For more digits, write a bigger program.

[/code]
Lisp interpreter.

#define d define
#d a include
#a <stdio.h>
#a <string.h>
#a <ctype.h>
#d p char*
#d P ,(p)
#d T(E) !strcmp(E,"()")
#d U return
#d W while
#d X sbrk(199)
#d z atof
#d e isspace
#d D A(_)
#d E S(C(_))
#d B(y) p y(_)p _;{
#d G(y,V) B(y)p i;U sprintf(i=X,"%lf",z(E)V z(S(C(D)))),i;}

        p sbrk(),*S(),*j(),*O,*H;K,Y,M=14;double
      z();Q(_)p _;{int V=0;W(e(*_))_++;H=_;W(V|!(e
    (*H)|*H==')'||(*H=='('&&H-_)))V+=(*H=='(')-(*H==
      ')'),H++;U H-_;}B(C)U _++,Y=Q(_),_=strncpy(X,_,Y),_[
    Y]=0,_;}B(A)_++,_+=Q(_);W(e(*_))_++;U O=X,*O='(',strcpy(
  O+1,_),O;}B(Z)U _;}B(c)U C(E);}B(q)U A(E);}B(t)p i=E;U H=S(C
(D)),sprintf(O=X,T(H                 )?"(%s)":"(%s %s",i,H+1)

         ,O;}B(F)U S(C(A(T(E)?D:_)));}L(i,s)p

i,*s;{U isdigit(*i)        ?         z(i)!=z(s):strcmp(i,s);}
  B(b)U L(E,S(C(D)))?"()":"t";}B(R)U E;}B(o)U z(E)<z(S(C(D)))?
    "t":"()";}G(f,+)G(g,-)G(h,*)p r[4][2]={"function"   P R,
      "quote"P C,"lambda"P Z,"defun"P j};B(j)U r[M][1]=D,*
    r[M++]=C(_);}p not[99][2]={"if"P F,"equal"P b,"<"
      P o,"+"P f,"-"P g,"*"P h,"car"P c,"cdr"P q,
        "cons"P t,"t","t"};B(S)int Li,s;p u;if(
          isdigit(*_)|T(_))U _;for(Y=M;Y--;)
        if(!strcmp(_,*r[Y]))U r[Y][1]
          ;u=E,_=D;if(*u-'(')U(*((p(*)())u)
        )(_);s=Li=M;W(!T(_))r[M][1]=E,*r[M++]
    ="",_=D;O=C(u);W(!T(O))*r[Li++]=C(O),O=A(O);U O=S
    (C(A(u))),M=s,O;}main(){H=O=X,Y=0;W(Y|!e(K=getchar()))K==
    EOF?exit(0):0,Y+=(K=='(')-(K==')'),*H++=K;*H=0,puts(S(O))
                ,
         main();{printf("XLISP 4.0\n");}}

Best of show:

    Jari Arkko, Ora Lassila, Esko Nuutila
    Laboratory of Information Processing Science
    Helsinki University of Technology
    Otakaari 1
    02150 Espoo
    Finland

Judges notes:

    This is the most useful program entered this year. It is a
    rather large subset of lisp.  It has no error recovery, and
    performs rather poorly in a number of cases.  Even so, placing
    all this functionality in such a small, densely packed program,
    is impressive enough to win the Best of show award.

Selected notes from the author:

    This program implements a Lisp interpreter in 1465 bytes of source.
    Some sophisticated features supported, eg. functionals and recursion. 
    The special-forms/functions/variables implemented are:
   
        +    -    *    <    ()   
        car    cdr    cons    defun    equal
        function if    lambda    quote    t
   
    Below are sample lisp expressions you might choose to try as input.
    The program implements a conventional lisp listener, i.e. you type in
    lisp expressions (followed by CR), the program evaluates them and
    prints out the return values. End execution by typing an end-of-file
    character.
   
    (+ 2.5 3.1)
    (defun fib (n)
       (if (< n 2)
           1
           (+ (fib (- n 2)) (fib (- n 1)))))
    (fib 10)
    (defun ! (x) (if (equal x 0) 1 (* x (! (- x 1)))))
    (! 7)
    (defun fn1 (fn) (+ (fn 1 2) (fn 3 4)))
    (defun fn2 (a b) (+ a b))
    (fn1 (function +))
    (fn1 (function fn2))
    (fn1 (function (lambda (z1 z2) (+ z1 z2))))
    (quote a)
    (cons (quote (a b)) (quote (c d e)))
    (cons (quote (f)) ())
    (car (quote (a b c)))
    (cdr (cdr (quote (g h i))))
   
    Please do not leave any whitespace before the first parenthesis when
    you type your input, or any other unnecessary whitespace. Please try to
    avoid any undefined variables or functions, wrong number of arguments
    etc. All these errors are likely to dump core (i.e. there are no error
    checks in the program).
   
    Traditional Lisp implementations use cons cells as the main data
    structure. Lists are organized of pointer chains of these cells.
    In this program, an alternate representation was chosen: char*'s.
    All list operations, including the ones in the interpreter, are
    made using string representations of the lists. These operations
    must count parentheses and skip whitespace. This leads to extremely
    poor performance!

Copyright (c) 1989, Landon Curt Noll & Larry Bassel.
All Rights Reserved.  Permission for personal, educational or non-profit use is
granted provided this this copyright and notice are included in its entirety
and remains unaltered.  All other uses must receive prior permission in writing
from both Landon Curt Noll and Larry Bassel.

[/code]

Ah, fuck. Try again.

#define d define
#d a include
#a <stdio.h>
#a <string.h>
#a <ctype.h>
#d p char*
#d P ,(p)
#d T(E) !strcmp(E,"()")
#d U return
#d W while
#d X sbrk(199)
#d z atof
#d e isspace
#d D A(_)
#d E S(C(_))
#d B(y) p y(_)p _;{
#d G(y,V) B(y)p i;U sprintf(i=X,"%lf",z(E)V z(S(C(D)))),i;}

        p sbrk(),*S(),*j(),*O,*H;K,Y,M=14;double
      z();Q(_)p _;{int V=0;W(e(*_))_++;H=_;W(V|!(e
    (*H)|*H==')'||(*H=='('&&H-_)))V+=(*H=='(')-(*H==
      ')'),H++;U H-_;}B(C)U _++,Y=Q(_),_=strncpy(X,_,Y),_[
    Y]=0,_;}B(A)_++,_+=Q(_);W(e(*_))_++;U O=X,*O='(',strcpy(
  O+1,_),O;}B(Z)U _;}B(c)U C(E);}B(q)U A(E);}B(t)p i=E;U H=S(C
(D)),sprintf(O=X,T(H                 )?"(%s)":"(%s %s",i,H+1)

         ,O;}B(F)U S(C(A(T(E)?D:_)));}L(i,s)p

i,*s;{U isdigit(*i)        ?         z(i)!=z(s):strcmp(i,s);}
  B(b)U L(E,S(C(D)))?"()":"t";}B(R)U E;}B(o)U z(E)<z(S(C(D)))?
    "t":"()";}G(f,+)G(g,-)G(h,*)p r[4][2]={"function"   P R,
      "quote"P C,"lambda"P Z,"defun"P j};B(j)U r[M][1]=D,*
    r[M++]=C(_);}p not[99][2]={"if"P F,"equal"P b,"<"
      P o,"+"P f,"-"P g,"*"P h,"car"P c,"cdr"P q,
        "cons"P t,"t","t"};B(S)int Li,s;p u;if(
          isdigit(*_)|T(_))U _;for(Y=M;Y--;)
        if(!strcmp(_,*r[Y]))U r[Y][1]
          ;u=E,_=D;if(*u-'(')U(*((p(*)())u)
        )(_);s=Li=M;W(!T(_))r[M][1]=E,*r[M++]
    ="",_=D;O=C(u);W(!T(O))*r[Li++]=C(O),O=A(O);U O=S
    (C(A(u))),M=s,O;}main(){H=O=X,Y=0;W(Y|!e(K=getchar()))K==
    EOF?exit(0):0,Y+=(K=='(')-(K==')'),*H++=K;*H=0,puts(S(O))
                ,
         main();{printf("XLISP 4.0\n");}}


Best of show:

    Jari Arkko, Ora Lassila, Esko Nuutila
    Laboratory of Information Processing Science
    Helsinki University of Technology
    Otakaari 1
    02150 Espoo
    Finland

Judges notes:

    This is the most useful program entered this year. It is a
    rather large subset of lisp.  It has no error recovery, and
    performs rather poorly in a number of cases.  Even so, placing
    all this functionality in such a small, densely packed program,
    is impressive enough to win the Best of show award.

Selected notes from the author:

    This program implements a Lisp interpreter in 1465 bytes of source.
    Some sophisticated features supported, eg. functionals and recursion. 
    The special-forms/functions/variables implemented are:
   
        +    -    *    <    ()   
        car    cdr    cons    defun    equal
        function if    lambda    quote    t
   
    Below are sample lisp expressions you might choose to try as input.
    The program implements a conventional lisp listener, i.e. you type in
    lisp expressions (followed by CR), the program evaluates them and
    prints out the return values. End execution by typing an end-of-file
    character.
   
    (+ 2.5 3.1)
    (defun fib (n)
       (if (< n 2)
           1
           (+ (fib (- n 2)) (fib (- n 1)))))
    (fib 10)
    (defun ! (x) (if (equal x 0) 1 (* x (! (- x 1)))))
    (! 7)
    (defun fn1 (fn) (+ (fn 1 2) (fn 3 4)))
    (defun fn2 (a b) (+ a b))
    (fn1 (function +))
    (fn1 (function fn2))
    (fn1 (function (lambda (z1 z2) (+ z1 z2))))
    (quote a)
    (cons (quote (a b)) (quote (c d e)))
    (cons (quote (f)) ())
    (car (quote (a b c)))
    (cdr (cdr (quote (g h i))))
   
    Please do not leave any whitespace before the first parenthesis when
    you type your input, or any other unnecessary whitespace. Please try to
    avoid any undefined variables or functions, wrong number of arguments
    etc. All these errors are likely to dump core (i.e. there are no error
    checks in the program).
   
    Traditional Lisp implementations use cons cells as the main data
    structure. Lists are organized of pointer chains of these cells.
    In this program, an alternate representation was chosen: char*'s.
    All list operations, including the ones in the interpreter, are
    made using string representations of the lists. These operations
    must count parentheses and skip whitespace. This leads to extremely
    poor performance!

Copyright (c) 1989, Landon Curt Noll & Larry Bassel.
All Rights Reserved.  Permission for personal, educational or non-profit use is
granted provided this this copyright and notice are included in its entirety
and remains unaltered.  All other uses must receive prior permission in writing
from both Landon Curt Noll and Larry Bassel.

Still doesn't look like the picture the original code makes, even though I used ..

>>18
OK, I give up. How'd you get yours to line up so well? The 'code' tag is the only one I can find, and it failed for >>23, which is supposed to have a sharply defined triangular outline.

>>25
man expand

>>23
My other car is a \x63\144r

Test:

            p sbrk(),*S(),*j(),*O,*H;K,Y,M=14;double
          z();Q(_)p _;{int V=0;W(e(*_))_++;H=_;W(V|!(e
        (*H)|*H==')'||(*H=='('&&H-_)))V+=(*H=='(')-(*H==
      ')'),H++;U H-_;}B(C)U _++,Y=Q(_),_=strncpy(X,_,Y),_[
    Y]=0,_;}B(A)_++,_+=Q(_);W(e(*_))_++;U O=X,*O='(',strcpy(
  O+1,_),O;}B(Z)U _;}B(c)U C(E);}B(q)U A(E);}B(t)p i=E;U H=S(C
(D)),sprintf(O=X,T(H                     )?"(%s)":"(%s %s",i,H+1)

             ,O;}B(F)U S(C(A(T(E)?D:_)));}L(i,s)p

i,*s;{U isdigit(*i)             ?         z(i)!=z(s):strcmp(i,s);}
  B(b)U L(E,S(C(D)))?"()":"t";}B(R)U E;}B(o)U z(E)<z(S(C(D)))?
    "t":"()";}G(f,+)G(g,-)G(h,*)p r[4][2]={"function"   P R,
      "quote"P C,"lambda"P Z,"defun"P j};B(j)U r[M][1]=D,*
        r[M++]=C(_);}p not[99][2]={"if"P F,"equal"P b,"<"
          P o,"+"P f,"-"P g,"*"P h,"car"P c,"cdr"P q,
            "cons"P t,"t","t"};B(S)int Li,s;p u;if(
              isdigit(*_)|T(_))U _;for(Y=M;Y--;)
                if(!strcmp(_,*r[Y]))U r[Y][1]
              ;u=E,_=D;if(*u-'(')U(*((p(*)())u)
            )(_);s=Li=M;W(!T(_))r[M][1]=E,*r[M++]
        ="",_=D;O=C(u);W(!T(O))*r[Li++]=C(O),O=A(O);U O=S
    (C(A(u))),M=s,O;}main(){H=O=X,Y=0;W(Y|!e(K=getchar()))K==
    EOF?exit(0):0,Y+=(K=='(')-(K==')'),*H++=K;*H=0,puts(S(O))
                                ,
                main();{printf("XLISP 4.0\n");}}

>>26
Thanks.
And I apologize to everything for my failure.
Profound it was, for I am too old to be done in by tabs.
Or perhaps failure comes full circle over time.
So, do your thing while your brain still works.

a very elegant fork bomb:

:(){ :|:& };:

>>30
> :(){ :|:& };:

Error: undefined variable
       :
       (package user)
1>
Warning: invalid expression
         ()
         (&syntax-error)
'syntax-error
1>
Error: illegal character read
       #\{
       (&i/o-port-error (port . #{Input-port #{Input-channel "standard input"}}))
       (&i/o-read-error (port . #{Input-port #{Input-channel "standard input"}}))

:(){ :|:& };:

:()

Do the La la la la la la Laaaaaaaa la

Prelude> :(){ :|:& };:
unknown command ':(){'
use :? for help.
Prelude>

>>34
:?

>>35
Read YHBT.

>>35
:3

>>36
YHBT Haskell Beginner's Tutorial?

>>38
Idiot.
You are not welcome in this thread.
Eat shit and die.

>>39
hi

>>39
I think that you have been trolled.

>>39
YHBT

>>1-42
Same person, and we have been trolled constantly.

>>43
different person

char main[] = {
    0xe8, 0x0e, 0x00, 0x00, 0x00, 0x48, 0x65,
    0x6c, 0x6c, 0x6f, 0x2c, 0x20, 0x77, 0x6f,
    0x72, 0x6c, 0x64, 0x21, 0x0a, 0xba, 0x0e,
    0x00, 0x00, 0x00, 0x59, 0xbb, 0x01, 0x00,
    0x00, 0x00, 0xb8, 0x04, 0x00, 0x00, 0x00,
    0xcd, 0x80, 0x31, 0xc0, 0xc3
};

short main[] = {
    3816, 0, 044000, 27749, 28524, 8236, 28535, 27762, 0x2164, -17910, 14,
    0, -0x44a7, 1, 0, 1208, 0, -031400, 12672, -15424
};

uintmax_t main = 59419540260542660666515320684408995105923040267208355385027412917326646690004211648787991890476725006361112898;

>>47
512-bit machine?

>>47
59419540260542660666515320684408995105923040267208355385027412917326646690004211648787991890476725006361112898

AHA!