482

C, (14 + 15) = 29 byte source, 17,179,875,837 (16 GB) byte executable Thanks to @viraptor for 6 bytes off. Thanks to @hvd for 2 bytes off and executable size x4. This defines the main function as a large array and initialises its first element. This causes GCC to store the entire array in the resulting executable. Because this array is bigger than 2GB, we ...


218

Python 3, 13 byte source, 9,057,900,463 byte (8.5GiB) .pyc-file (1<<19**8,)*2 Edit: Changed the code to the version above after I realized the rules say output size beyond 4GiB doesn't matter, and the code for this one is ever so slightly shorter; The previous code - and more importantly the explanation - can be found below. Python 3, 16 byte source,...


214

C#, about 1 min to compile, 28MB output binary: class X<A,B,C,D,E>{class Y:X<Y,Y,Y,Y,Y>{Y.Y.Y.Y.Y.Y.Y.Y.Y y;}} Adding more Y's will increase the size exponentially. An explanation by Pharap as per @Odomontois' request: This answer is abusing inheritance and type parameters to create recursion. To understand what's happening, it's easier to ...


137

If an output of more than 4GB is achieved (perhaps if somebody finds a turing complete preprocessor), the competition will be for the smallest source which produces a file of at least that size (it's just not practical to test submissions which get too big). "Template Haskell" allows Haskell code to be generated at compile-time using Haskell, and is hence a ...


125

Perl, >1.96835797883262e+18 time*time Might not be the largest answer... today! But wait enough millennia and it will be! Edit: To address some of the comments, by "enough millenia," I do in fact mean n100s of years. To be fair, if the big freeze/heat death of the universe is how the universe will end (estimated to occur ~10100 years), the "final" value ...


105

Blockquotes, 137,469/256 = 536.99 6,908 characters, 511 new lines, 130,050 spaces Markdown sure handles nested block-quotes oddly. Each > character gets turned into <blockquote></blockquote> so a solid 1 to 25 ratio. But wait! When rendering the HTML it also adds two spaces per nesting! Having this try to render causes my browser some grief, ...


102

Windows 2000 - Windows 8 (3907172 / 23³ = 321) NOTE: DON'T F'ING RUN THIS! Save the following to a batch file and run it as Administrator. CD|Format D:/FS:FAT/V/Q Output when run on a 4TB drive with the first printed number in bold. Insert new disk for drive D: and press ENTER when ready... The type of the file system is NTFS. The new file system ...


91

GolfScript, score: way too much OK, how big a number can we print in a few chars of GolfScript? Let's start with the following code (thanks, Ben!), which prints 126: '~'( Next, let's repeat it 126 times, giving us a number equal to about 1.26126 × 10377: '~'(.`* (That's string repetition, not multiplication, so it should be OK under the rules.) ...


87

C++, 250 + 26 = 276 bytes template<int A,int B>struct a{static const int n;}; template<int A,int B>const int a<A,B>::n=a<A-1,a<A,B-1>::n>::n; template<int A>struct a<A,0>{static const int n=a<A-1,1>::n;}; template<int B>struct a<0,B>{static const int n=B+1;}; int h=a<4,2>::n; This is the ...


66

Here's my C answer from 2005. Would produce a 16TB binary if you had 16TB RAM (you don't). struct indblock{ uint32_t blocks[4096]; }; struct dindblock { struct indblock blocks[4096]; }; struct tindblock { struct dindblock blocks[4096]; }; struct inode { char data[52]; /* not bothering to retype the details */ struct indblock ind; ...


65

ASM, 61 bytes (29 bytes source, 32 bytes for flags), 4,294,975,320 bytes executable .globl main main: .zero 1<<32 Compile with gcc the_file.s -mcmodel=large -Wl,-fuse-ld=gold


63

JavaScript, 39 (function f(x){for(;x!=++x;)f(x+1)})(0) Explanation Since JavaScript does not precisely represent large integers, the loop for(;x!=++x;) terminates once x hits 9007199254740992. The body of the for loop will be executed Fib(9007199254740992) - 1 times, where Fib(n) is the nth fibonacci number. From testing, I know my computer will do less ...


62

MathJax, 529\$\,\$252\$\,\$640ish / 256 ≈ 2\$\,\$067\$\,\$393 A good old thousand-laughs-style code $$\def\a{🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣🤣...


47

Python (9) 9**9**1e9 This has more than 10**10000000 bits, so computing it should take us far past heat death. I checked that this takes more and more time for larger but still reasonable values, so it's not just being optimized out by the interpreter. Edit: Golfed two chars by removing parens thanks to @user2357112. TIL that Python treats successive ...


44

JavaScript 44 chars This may seem a little cheaty: alert((Math.PI+''+Math.E).replace(/\./g,"")) Score = 31415926535897932718281828459045 / 44^3 ≈ 3.688007904758867e+26 ≈ 10↑↑2.1536134004


42

New Ruby, 135 bytes, >> Hψ(φ3(Ω+1))(9) where H is the Hardy hierarchy, ψ is an extended version of Madore's OCF (will explain below) and φ is the Veblen function. Try it online! f=->a,n,b=a{c,d,e=a;a==c ?a-1:e ?a==a-[0]?[[c,d,f[e,n,b]],d-1,c]:c:[n<1||c==0?n:[f[c||b,n-1]],n,n]};h=[],k=9,k;h=f[h,p(k*=k)]while h!=0 Ungolfed: (using functions, not ...


37

Bash, 9223372036854775810 Inspired by Doorknob's answer. a='"2>/dev/null;if(((i=$((i-1)))>0));then $(declare -p a);$a;else 1;fi #"' i=2**63 eval $a It should be run with bash < file.sh, or use the same file name for each program, to get rid of the different file names in the error messages. The first few errors are (with LANG=C): bash: line 3: ...


35

CJam, 5 bytes 0{)}h How it works 0 " Push 0. "; { " "; ) " Increment the Big Integer on the stack. "; }h " Repeat if the value is non-zero. "; This program will halt when the heap cannot store the Big Integer anymore, which won't happen anytime soon on a modern ...


35

Marbelous 68 66 bytes }0 --@2 @2/\=0MB }0@1\/ &0/\>0!! -- @1 00@0 --/\=0 \\@0&0 Marbelous is an 8 bit language with values only represented by marbles in a Rube Goldberg-like machine, so this wasn't very easy. This approach is roughly equivalent to the following pseudo-code: function recursiveFunction(int i) { for(int j = i*512; j > 0; j--)...


35

GolfScript (12 7 chars) 9,{\?}* This computes and prints 8^7^6^5^4^3^2 ~= 10^10^10^10^183230. To print it (never mind the computation) in 10^1000 years ~= 10^1007.5 seconds, it needs to print about 10^(10^10^10^183230 - 10^3) digits per second.


30

Plain old C preprocessor: 214 bytes input, 5MB output Inspired by my real-world preprocessor fail here. #define A B+B+B+B+B+B+B+B+B+B #define B C+C+C+C+C+C+C+C+C+C #define C D+D+D+D+D+D+D+D+D+D #define D E+E+E+E+E+E+E+E+E+E #define E F+F+F+F+F+F+F+F+F+F #define F x+x+x+x+x+x+x+x+x+x int main(void) { int x, y = A; } Experiments show that each level of #...


29

CJam, 2 × 10268,435,457 A28{_*}*K* This computes b, defined as follows: a0 = 10 an = an - 12 b = 20 × a28 $ time cjam <(echo 'A28{_*}*K*') | wc -c Real 2573.28 User 2638.07 Sys 9.46 268435458 Background This follows the same idea as Claudiu's answer, but it isn't based on it. I had a similar idea which I posted just a few minutes after he ...


29

Java, 450 + 22 = 472 bytes source, ~1GB class file B.java (golfed version, warning during compilation) import javax.annotation.processing.*;@SupportedAnnotationTypes("java.lang.Override")public class B extends AbstractProcessor{@Override public boolean process(java.util.Set a,RoundEnvironment r){if(a.size()>0){try(java.io.Writer w=processingEnv.getFiler(...


28

C, score = 101097.61735/983 ≈ 10↑↑2.29874984 unsigned long a,b,c,d,e;main(){while(++a)while(++b)while(++c)while(++d)while(++e)printf("%lu",a);} I appreciate the help in scoring. Any insights or corrections are appreciated. Here is my method: n = the concatenation of every number from 1 to 264-1, repeated (264-1)4 times. First, here's how I'm estimating (...


27

Haskell, 252 Bytes, TREE(3)+1 data T=T[T]Int l(T n _)=1+sum(l<$>n) a@(T n c)#T m d=any(a#)m||c==d&&n!m l@(x:t)!(y:u)=l!u||x#y&&t!u x!_=null x a n=do x<-[1..n];T<$>mapM(\_->a$n-1)[2..x]<*>[1..3] s 0=[[]] s n=[t:p|p<-s$n-1,t<-a n,(l t<=n)>any(#t)p] main=print$[x|x<-[0..],null$s x]!!0 Thanks for help from ...


26

Wolfram Language ack(9!,9!) Try it online! $$\text{ack}(9!,9!) = 2 \uparrow^{362878} 362883 - 3$$ Output is in Arrow Notation.


26

gs2, 412 + 5.37 * 10902 + 1010903.1 bytes f pushes 1\n2\nFizz\n4\nBuzz\n...\nFizzBuzz as a 412-byte string. fô prints all of its permutations, so 412! * 412 characters. fôô prints all permutations of that 412!-element list, where each element is 412 characters long, so 412 * (412!)! bytes. EDIT: To put things into perspective, this is at least ...


26

C, 26 byte source, 2,139,103,367 byte output, valid program const main[255<<21]={195}; Compiled using: gcc cbomb.c -o cbomb (gcc version 4.6.3, Ubuntu 12.04, ~77 seconds) I thought I'd try to see how large I could make a valid program without using any command line options. I got the idea from this answer: https://codegolf.stackexchange.com/a/69193/...


Only top voted, non community-wiki answers of a minimum length are eligible