You're probably familiar with zip bombs, XML bombs, etc. Put simply, they are (relatively) small files which produce enormous output when interpreted by naïve software. The challenge here is to abuse a compiler in the same way.


Write some source code which occupies 512 bytes or less and which compiles into a file which occupies the most possible space. Largest output file wins!


OK, so there are a few important clarifications, definitions and restrictions;

  • The output of the compilation must be an ELF file, a Windows Portable Executable (.exe), or virtual bytecode for the JVM or .Net's CLR (other types of virtual bytecode are also likely to be OK if asked for). Update: Python's .pyc / .pyo output also counts.
  • If your language-of-choice can't be compiled directly into one of those formats, transpilation followed by compilation is also allowed (Update: you can transpile multiple times, just so long as you never use the same language more than once).
  • Your source code can consist of multiple files, and even resource files, but the summed size of all these files must not exceed 512 bytes.
  • You cannot use any other input than your source file(s) and the standard library of your language-of-choice. Static linking standard libraries is OK when it's supported. Specifically, no third party libraries or OS libraries.
  • It must be possible to invoke your compilation using a command or series of commands. If you require specific flags when compiling, these count towards your byte limit (e.g. if your compile line is gcc bomb.c -o bomb -O3 -lm, the -O3 -lm part (7 bytes) will be counted (note the initial leading space isn't counted).
  • Preprocessors are permitted only if they are a standard compilation option for your language.
  • The environment is up to you, but in the interests of making this verifiable, please stick to recent (i.e. available) compiler versions and operating systems (and obviously specify which you're using).
  • It must compile without errors (warnings are OK), and crashing the compiler doesn't count for anything.
  • What your program actually does is irrelevant, though it can't be anything malicious. It doesn't even have to be able to start.

Example 1

The C program

main(){return 1;}

Compiled with Apple LLVM version 7.0.2 (clang-700.1.81) on OS X 10.11 (64-bit):

clang bomb.c -o bomb -pg

Produces a file of 9228 bytes. The total source size is 17+3 (for the -pg) = 20 bytes, which is easily within size limit.

Example 2

The Brainfuck program:


Transpiled with awib to c with:

./awib < > bomb.c

Then compiled with Apple LLVM version 7.0.2 (clang-700.1.81) on OS X 10.11 (64-bit):

clang bomb.c

Produces a file of 8464 bytes. The total input here is 143 bytes (since @lang_c is the default for awib it didn't need to be added to the source file, and there are no special flags on either command).

Also note that in this case, the temporary bomb.c file is 802 bytes, but this counts towards neither the source size nor the output size.

Final Note

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).

  • If using a transpiler, does the output source code need to be under 512 bytes as well as the input source code? – trichoplax Jan 11 '16 at 23:57
  • 3
    Is repeated transpilation allowed? – orlp Jan 12 '16 at 0:02
  • 3
    @LegionMammal978 yes it has to produce one of the file types I specified. But if you think you've found something which is more virtual-machine than interpreted-language, ask about it specifically and it's possible I'll allow it (it's a bit subjective so I wanted to be very restrictive to begin, with the option of opening it up) – Dave Jan 12 '16 at 0:21
  • 3
    @trichoplax I wasn't aware of that, but from some reading it looks like yes; compiling to Python bytecode absolutely counts. So for python, the output size would be the sum total size of all your pyc/pyo files. I'll update the question soon with these comment-based updates. – Dave Jan 12 '16 at 0:58
  • 2
    @MartinRosenau - WGroleau already asked a similar question; it's standard in coding challenges that you can use anything which already existed when the challenge began. – Dave Jan 17 '16 at 17:09

17 Answers 17

up vote 397 down vote

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 need to provide the -mcmodel=medium flag to GCC. The extra 15 bytes are included in the score, as per the rules.


Don't expect this code to do anything nice when run.

Compile with:

gcc -mcmodel=medium cbomb.c -o cbomb

It took me a while to get round to testing @hvd's suggestion - and to find a machine with enough juice to handle it. Eventually I found a old non-production RedHat 5.6 VM with 10GB RAM, 12GB swap, and /tmp set to a large local partition. GCC version is 4.1.2. Total compile time about 27 minutes.

Due to the CPU and RAM load, I recommend against doing this compile on any remotely production-related machine.

  • 10
  • 11
    I'm playing against my solution here, but... you don't need a. You can just use main[1<<30]={1}; – viraptor Jan 12 '16 at 1:41
  • 35
    Oh my. This is evil. X froze for several minutes trying to compile that code. I was starting to look for another computer to possibly ssh back in and kill the gcc process before it finally came back to life. Btw. If you want a larger value than 1<<30 then 7<<28 could be an option. – kasperd Jan 12 '16 at 19:55
  • 29
    >4gb? That escalated quickly – Wayne Werner Jan 13 '16 at 1:28
  • 15
    In case anyone else is wondering why this compiles:… – T. C. Jan 13 '16 at 11:40

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 first simplify the problem. Consider class X<A> { class Y : X<Y> { Y y; } }, which generates the generic class X<A>, which has an inner class Y. X<A>.Y inherits X<Y>, hence X<A>.Y also has an inner class Y, which is then X<A>.Y.Y. This then also has an inner class Y, and that inner class Y has an inner class Y etc. This means that you can use scope resolution (.) ad infinitum, and every time you use it, the compiler has to deduce another level of inheritance and type parameterisation.

By adding additional type parameters, the work the compiler has to do at each stage is further increased.

Consider the following cases:
In class X<A> { class Y : X<Y> { Y y;} } type param A has a type of X<A>.Y.
In class X<A> { class Y : X<Y> { Y.Y y;} } type param A has a type of X<X<A>.Y>.Y.
In class X<A> { class Y : X<Y> { Y.Y.Y y;} } type param A has a type of X<X<X<A>.Y>.Y>.Y.
In class X<A,B> { class Y : X<Y,Y> { Y y;} } type param A is X<A,B>.Y and B is X<A,B>.Y.
In class X<A> { class Y : X<Y> { Y.Y y;} } type param A is X<X<A,B>.Y, X<A,B>.Y>.Y and B is X<X<A,B>.Y, X<A,B>.Y>.Y.
In class X<A> { class Y : X<Y> { Y.Y.Y y;} } type param A is X<X<X<A,B>.Y, X<A,B>.Y>.Y, X<X<A,B>.Y, X<A,B>.Y>.Y>.Y and B is X<X<X<A,B>.Y, X<A,B>.Y>.Y, X<X<A,B>.Y, X<A,B>.Y>.Y>.Y.

Following this pattern, one can only imagine1 the work the compiler would have to do to to deduce what A to E are in Y.Y.Y.Y.Y.Y.Y.Y.Y in the definition 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;}}.

1 You could figure it out, but you'd need a lot of patience, and intellisense won't help you out here.

  • 12
    This is more like the sort of insanity I was expecting! Looks like I'm off to reinstall Mono… – Dave Jan 12 '16 at 2:00
  • 29
    Can you provide an explanation of such notorious effect? – Odomontois Jan 12 '16 at 8:58
  • 14
    +1 for doing more than just initializing a large array. – Stig Hemmer Jan 12 '16 at 9:18
  • 5
    Here's an example using Try Roslyn and just 3 Ys. – Kobi Jan 12 '16 at 12:21
  • 8
    I saw this question and immediately thought of you. Nice! – Eric Lippert Jan 13 '16 at 16:14

Python 3, 13 byte source, 9,057,900,463 byte (8.5GiB) .pyc-file


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, >32TB .pyc-file (if you have enough memory, disk space and patience)


Explanation: Python 3 does constant folding, and you get big numbers fast with exponentation. The format used by .pyc files stores the length of the integer representation using 4 bytes, though, and in reality the limit seems to be more like 2**31, so using just exponentation to generate one big number, the limit seems to be generating a 2GB .pyc file from an 8 byte source. (19**8 is a bit shy of 8*2**31, so 1<<19**8 has a binary representation just under 2GB; the multiplication by eight is because we want bytes, not bits)

However, tuples are also immutable and multiplying a tuple is also constant folded, so we can duplicate that 2GB blob as many times as we want, up to at least 2**31 times, probably. The 4**7 to get to 32TB was chosen just because it was the first exponent I could find that beat the previous 16TB answer.

Unfortunately, with the memory I have on my own computer, I could test this only up to a multiplier of 2, ie. (1<<19**8,)*2, which generated a 8.5GB file, which I hope demonstrates that the answer is realistic (ie. the file size isn't limited to 2**32=4GB).

Also, I have no idea why the file size I got when testing was 8.5GB instead of the 4GB-ish I expected, and the file is big enough that I don't feel like poking around it at the moment.

  • 2
    +1, but why don't (1<<19**8,)*2? 4GB is enough. – Akangka Jan 14 '16 at 10:38
  • 2
    @ChristianIrwan: Yeah, I'd forgotten that rule, only realized it a few minutes ago and haven't figured out what kind of edit I should make yet. :-) – Aleksi Torhamo Jan 14 '16 at 10:46
  • 1
    Nice. Since this is only 13 bytes, we finally have a challenger to the first-posted answer! I was only able to confirm 1<<18 on my machine (1.5GB) but I'll test it on linux later, where I expect it will work with the full 8GB (not going to try the 32TB version!) – Dave Jan 17 '16 at 17:22
  • 1
    @Dave: The exact size might depend on the version (1.5GB sounds weird no matter what, though); I was using Python 3.3.5, and used python -m py_compile to generate the .pyc-file. – Aleksi Torhamo Jan 17 '16 at 18:17
  • 2
    IIRC, python uses 30 bits per 32-bit word in its integer representation – Hurkyl Oct 6 '16 at 23:34

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 turing complete pre-processor.

Here's my attempt, parameterised by an arbitrary numerical expression FOO:

import Language.Haskell.TH;main=print $(ListE .replicate FOO<$>[|0|])

The magic is the code inside the "splice" $(...). This will be executed at compile time, to generate a Haskell AST, which is grafted on to the program's AST in place of the splice.

In this case, we make a simple AST representing the literal 0, we replicate this FOO times to make a list, then we use ListE from the Language.Haskell.TH module to turn this list of ASTs into one big AST, representing the literal [0, 0, 0, 0, 0, ...].

The resulting program is equivalent to main = print [0, 0, 0, ...] with FOO repetitions of 0.

To compile to ELF:

$ ghc -XTemplateHaskell big.hs
[1 of 1] Compiling Main             ( big.hs, big.o )
Linking big ...
$ file big
big: ELF 32-bit LSB executable, Intel 80386, version 1 (SYSV), dynamically linked, interpreter /nix/store/mibabdfiaznqaxqiy4bqhj3m9gaj45km-glibc-2.21/lib/, for GNU/Linux 2.6.32, not stripped

This weighs in at 83 bytes (66 for the Haskell code and 17 for the -XTemplateHaskell argument), plus the length of FOO.

We can avoid the compiler argument and just compile with ghc, but we have to put {-# LANGUAGE TemplateHaskell#-} at the beginning, which bumps the code up to 97 bytes.

Here are a few example expressions for FOO, and the size of the resulting binary:

FOO         FOO size    Total size    Binary size
(2^10)      6B          89B           1.1MB
(2^15)      6B          89B           3.6MB
(2^17)      6B          89B           12MB
(2^18)      6B          89B           23MB
(2^19)      6B          89B           44MB

I ran out of RAM compiling with (2^20).

We can also make an infinite list, using repeat instead of replicate FOO, but that prevents the compiler from halting ;)

  • 46
    Welcome to Programming Puzzles and Code Golf. This is a brilliant answer, especially for a new user to this site. If you need any help (which I doubt), feel free to ask. – wizzwizz4 Jan 12 '16 at 17:05
  • 3
    @wizzwizz4: Yeah, it is a brilliant answer. It's essentially the same as mine, except that in Haskell it requires a special compiler directive to make the metaprogramming work. ;) – Mason Wheeler Jan 12 '16 at 17:14
  • 2
    When I compile with GHC 7.8.3 I get "Not in scope: ‘<$>’" (I set the code to [...].replicate (2^10)<$>[|0|])). I'm not experienced with Haskell; any hints on how to make this compile? – Dave Jan 12 '16 at 23:36
  • 33
    Too bad template haskell isn't lazy enough to stream out an infinite executable. – PyRulez Jan 13 '16 at 1:46
  • 1
    Hi @Dave the <$> function is widely used in Haskell, but was only moved to the "prelude" (the set of functions available by default) in GHC 7.10. For earlier versions you'll need to add import Control.Applicative; after the exising import statement. I just tried with GHC 7.8.4 and it works. – Warbo Jan 13 '16 at 11:36

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 Ackermann function implemented in templates. I'm not able to compile with h=a<4,2>::n; on my little (6GB) machine, but I did manage h=a<3,14> for a 26M output file. You can tune the constants to hit your platform's limits - see the linked Wikipedia article for guidance.

Requires -g flag to GCC (because it's all the debug symbols that actually consume any space), and a larger-than-default template depth. My compile line ended up as

g++ -ftemplate-depth=999999 -g -c -o 69189.o 69189.cpp

Platform information

g++ (Ubuntu 4.8.2-19ubuntu1) 4.8.2
Linux 3.13.0-46-generic #79-Ubuntu SMP x86_64 GNU/Linux
  • I really like this one, but I'm not sure I can accept a .o output, since I did say ELF/.exe/etc. (and compiling this fully optimises it all out!). Still, +1 (and confirmed) – Dave Jan 12 '16 at 23:01
  • 4
    Update: As Ben Voigt points out on his answer, GCC on Linux does generate ELF files as .o output, and I've been able to confirm the <3,14> variant with it, so yup - this is valid. – Dave Jan 13 '16 at 0:34
  • 15
    I was expecting something absurd to come out of C++ templates. I wasn't expecting the Ackermann function. – Mark Jan 13 '16 at 9:42
  • won't Fibonacci give you a smaller code and better output size control? – Will Ness Jan 14 '16 at 21:45
  • 1
    But we want bigger code! Fibonacci gives almost the same size as pure linear code (but longer compile time that the linear). You could certainly have fun with a static array of size A+B in each class, now I think of it... – Toby Speight Jan 15 '16 at 13:40

ASM, 61 bytes (29 bytes source, 32 bytes for flags), 4,294,975,320 bytes executable

.globl main
.zero 1<<32

Compile with gcc the_file.s -mcmodel=large -Wl,-fuse-ld=gold

  • 4
    1<<30 is good enough for C. Since this is assembler, the size is in bytes. – viraptor Jan 12 '16 at 2:00
  • 2
    @viraptor My system has 32GB of RAM and for kicks I tried to build your code. as manages to hand off to ld, but ld fails with this. Not even -mcmodel=medium seems to help. – Iwillnotexist Idonotexist Jan 12 '16 at 2:49
  • 2
    try forcing use of gold linker: gcc -fuse-ld=gold ... compiles/links... eek! Finished in 1:29 (89 seconds) and size of 1,073,748,000 bytes. – lornix Jan 12 '16 at 7:47
  • 2
    I finally got this to assemble on 64-bit Ubuntu 15.10, with invocation gcc -o g g.s -mcmodel=large -Wl,-fuse-ld=gold. Final tally: 4,294,975,320 bytes, with 32 extra bytes added to the program length for -mcmodel=large -Wl,-fuse-ld=gold. Worth noting that the header is incorrect; the source is 29 bytes (without the extra flags added). – Mego Jan 12 '16 at 18:24
  • 3
    By bumping the allocation up to 1<<33, I ended up with a 8,589,942,616 byte executable. – Mego Jan 12 '16 at 18:37

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;
    struct dindblock dint;
    struct tindblock tind;

struct inode bbtinode;

int main(){}
  • 16
    "Would produce a 16TB binary if you had 16TB RAM (you don't)." - neither do I have a 16TB hard drive! I can't really verify this one, but it's cool nonetheless. – Dave Jan 12 '16 at 23:45
  • 4
    I discovered this one by accident and watched the compiler topple over when it ran out of address space. – Joshua Jan 12 '16 at 23:57
  • 7
    Please do NOT attempt to golf this entry; golfing defeats the intent of the code sample and there are no score benefits to doing so anyway. Code is already GPL'd as of 2005. – Joshua Jan 13 '16 at 2:23
  • 5
    @BenVoigt Regardless, editing other people's code is never acceptable here. Leave a comment if there's an issue. Relevant meta post:… – Mego Jan 14 '16 at 20:27
  • 2
    @Joshua: Check the markdown diff. Mego only added the highlighting hint. – n̴̖̋h̷͉̃a̷̭̿h̸̡̅ẗ̵̨́d̷̰̀ĥ̷̳ Jan 15 '16 at 7:59

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 #defines will (as expected) make the output approximately ten times larger. But since this example took more than an hour to compile, I never went on to "G".

  • 8
    This is kinda like an xml bomb – an earwig Jan 14 '16 at 19:24
  • 8
    Specifically it is an implementation of the original "Billion Laughs". – mınxomaτ Jan 15 '16 at 10:11
  • This is insane yet simple. – Vahid Amiri Jan 16 '16 at 8:20
  • 2
    Wow, this actually causes a segfault in GCC 4.9 and Clang. Which compiler did you use? – Dave Jan 17 '16 at 17:26
  • @Dave: gcc (Ubuntu 4.8.4-2ubuntu1~14.04) 4.8.4 – Thomas Padron-McCarthy Jan 18 '16 at 1:35

Java, 450 + 22 = 472 bytes source, ~1GB class file (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( w=processingEnv.getFiler().createSourceFile("C").openWriter()){w.write("class C{int ");for(int i=0;i<16380;++i){for(int j=0;j<65500;++j){w.write("i");}w.write(i+";int ");}w.write("i;}");}catch(Exception e){}}return true;}} (ungolfed version)

import java.util.Set;

import javax.annotation.processing.AbstractProcessor;
import javax.annotation.processing.RoundEnvironment;
import javax.annotation.processing.SupportedAnnotationTypes;
import javax.annotation.processing.SupportedSourceVersion;
import javax.lang.model.SourceVersion;
import javax.lang.model.element.TypeElement;

public class B extends AbstractProcessor {
    public boolean process(Set<? extends TypeElement> annotations, RoundEnvironment roundEnv) {
        if (annotations.size() > 0) {
            try (Writer writer = processingEnv.getFiler().createSourceFile("C").openWriter()) {
                writer.write("class C{int ");
                for (int i = 0; i < 16380; ++i) {
                    for (int j = 0; j < 65500; ++j) {
                    writer.write(i + ";int ");
            } catch (Exception e) {
        return true;


javac -J-Xmx16G -processor B


This bomb uses Annotation Processors. It needs 2 compile passes. The first pass builds the processor class B. During the second pass the processor creates a new source file, and compiles it to a C.class with a size of 1,073,141,162 bytes.

There are several limitations when trying to create a big class file:

  • Creating identifiers longer than about 64k results in: error: UTF8 representation for string "iiiiiiiiiiiiiiiiiiii..." is too long for the constant pool.
  • Creating more than about 64k variables/functions results in: error: too many constants
  • There is also a limit of about 64k for the code size of a function.
  • There seems to be a general limit (bug?) in the java compiler of about 1GB for the .class file. If I increase 16380 to 16390 in the above code the compiler never returns.
  • There is also a limit of about 1GB for the .java file. Increasing 16380 to 16400 in the above code results in: An exception has occurred in the compiler (1.8.0_66). Please file a bug ... followed by a java.lang.IllegalArgumentException.
  • 9
    Neat; you've essentially made your own preprocessor, within the size limit, in a language with a compiler which natively supports custom preprocessors. It's within the rules. The final class was only 0.5GB for me, but I can confirm the method. – Dave Jan 14 '16 at 0:17
  • Another example in Java - it uses nested try..finally (code in finally block is duplicated for normal and exceptional cases) and initializer block (code from initializer block is appended to each constructor) – Victor Jan 14 '16 at 10:37
  • I replaced the ä by an i and adjusted the numbers. Now the bomb should create a 1GB class on any system without any encoding issues. However, it now needs a lot more memory. – Sleafar Jan 16 '16 at 16:23
  • ? extends TypeElement?!? – cat Oct 9 '16 at 14:54
  • 1
    @cat See here:… – Sleafar Oct 9 '16 at 15:15

Boo, 71 bytes. Compile time: 9 minutes. 134,222,236 byte executable

macro R(e as int):
 for i in range(2**e):yield R.Body
x = 0
R 25:++x

Uses a macro R (for Repeat) to cause the compiler to multiply the increment statement an arbitrary number of times. No special compiler flags are needed; simply save the file as and invoke the compiler with booc to build it.

  • 2**e—what is this? Try 9**e! – wchargin Jan 13 '16 at 12:46
  • 1
    @WChargin: The fun thing about metaprogramming is how easily you can customize it! – Mason Wheeler Jan 13 '16 at 13:08
  • I'm having a bit of trouble installing boo… I'll confirm this one when I manage to install it! – Dave Jan 14 '16 at 0:20
  • @Dave What trouble are you having with it? – Mason Wheeler Jan 14 '16 at 0:25

Kotlin, 90 bytes source, 177416 bytes (173 KB) compiled JVM binary

inline fun a(x:(Int)->Any){x(0);x(1)}
fun b()=a{a{a{a{a{a{a{a{a{a{a{println(it)}}}}}}}}}}}

Technically, you could make this even longer by nesting the expression further. However, the compiler crashes with a StackOverflow error if you increase the recursion.

  • Your SI prefixes don't agree. Is that 177416 kilobytes = 173 MB, or 177416 bytes = 173 kB? – Ben Voigt Jan 12 '16 at 18:33
  • 1
    @BenVoigt Thank you for pointing that out :D – TheNumberOne Jan 12 '16 at 18:35
  • Impressive, have a +1 – J Atkin Jan 13 '16 at 0:42
  • For Kotlin 1.2.20 to compile we need to remove one depth and it's ~104kB. Which version did you use originally? – TWiStErRob Jan 23 at 1:05

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: by Digital Trauma. See the comments there as to why this compiles.

How it works: The const removes the write flag from the pages in the segment, so main can be executed. The 195 is the Intel machine code for a return. And since the Intel architecture is little-endian, this is the first byte. The program will exit with whatever the start up code put in the eax register, likely 0.

It's only about 2 gig because the linker is using 32 bit signed values for offsets. It's 8 meg smaller than 2 gig because the compiler/linker needs some space to work and this is the largest I could get it without linker errors - ymmv.

  • 2
    As an interesting aside, the output is 2,078,451 bytes gziped with max compression = 1029:1 compression ratio. – Zakipu Jan 21 '16 at 7:21

C++, 214 bytes (no special compile options needed)

#define Z struct X
#define T template<int N
T,int M=N>Z;struct Y{static int f(){return 0;}};T>Z<N,0>:Y{};T>Z<0,N>:Y{};T,int M>Z{static int f(){static int x[99999]={X<N-1,M>::f()+X<N,M-1>::f()};}};int x=X<80>::f();

It's a fairly straightforward two-dimensional template recursion (recursion depth goes as the square-root of total templates emitted, so won't exceed platform limits), with a small amount of static data in each one.

Generated object file with g++ 4.9.3 x86_64-pc-cygwin is 2567355421 bytes (2.4GiB).

Increasing the initial value above 80 breaks the cygwin gcc assembler (too many segments).

Also, 99999 can be replaced by 9<<19 or similar for increased size without changing the source code... but I don't think I need to use any more disk space than I already am ;)

  • Confirmed (in fact, it's 2.56GB with clang), but it needs a -c compile flag to stop the linker (2 extra bytes), and I'm not sure I can accept .o output (not one of the ones I listed). Still, I like it, so +1. – Dave Jan 12 '16 at 23:29
  • @Dave: gcc .o files are ELF format aren't they? – Ben Voigt Jan 12 '16 at 23:49
  • Not sure. They don't start with an ELF magic number when I generate them… I'll investigate later. – Dave Jan 13 '16 at 0:01
  • @Dave: Well, cygwin gcc isn't generating an ELF file. Linux gcc seems to (although I'm looking at one from a different piece of code) – Ben Voigt Jan 13 '16 at 0:17
  • Yes, GCC 5.2.1 on Kubuntu is indeed generating an ELF file, but it's only 9MB! Not sure how it's managed to compress it so much compared to the other compilers. Maybe GCC 4.9 would make a 2GB ELF file. – Dave Jan 13 '16 at 0:28

Scala - 70 byte source, 22980842 byte result (after jar)

import scala.{specialized => s}
class X[@s A, @s B, @s C, @s D, @s E]

This produces 95 (about 59,000) specialized class files, which pack into a jar of about 23 MB. You can in principle keep going if you have a filesystem that can handle that many files and enough memory.

(If the jar command must be included, it's 82 bytes.)

  • I could not compile it: error: java.lang.OutOfMemoryError: GC overhead limit exceeded. Could you also document the required command for compilation? – P.Péter Jan 18 '16 at 16:14
  • @P.Péter - You need to give the compiler more memory, e.g. scalac -J-Xmx12G X.scala is what I used. I didn't test how much it actually needs. – Rex Kerr Jan 18 '16 at 21:16
  • still not compiling, sadly :( error: error while loading AnnotatedElement, class file '/usr/lib/jvm/java-8-openjdk-amd64/jre/lib/rt.jar(java/lang/reflect/AnnotatedElement.class)' is broken (bad constant pool tag 18 at byte 76) one error found Can you specify the scala and java version (maybe platform, too)? I used scalac 2.9.2 and OpenJDK 1.8.0_66-internal-b17, on debian 8 x86-64. – P.Péter Feb 1 '16 at 12:41
  • Ubuntu 15.10, java version "1.8.0_72-ea" Java(TM) SE Runtime Environment (build 1.8.0_72-ea-b05) Java HotSpot(TM) 64-Bit Server VM (build 25.72-b05, mixed mode) , $ scala -version Scala code runner version 2.11.7 -- Copyright 2002-2013, LAMP/EPFL – Rex Kerr Feb 1 '16 at 14:20

C, 284 bytes + 2 for the -c in gcc bomb.c -o bomb.o -c; output: 2 147 484 052 bytes

#define a 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1
#define b a,a,a,a,a,a,a,a,a,a,a,a,a,a,a,a
#define c b,b,b,b,b,b,b,b,b,b,b,b,b,b,b,b
#define d c,c,c,c,c,c,c,c,c,c,c,c,c,c,c,c
#define e d,d,d,d,d,d,d,d,d,d,d,d,d,d,d,d
#define f e,e,e,e,e,e,e,e,e,e,e,e,e,e,e,e
__int128 x[]={f,f,f,f,f,f,f,f};

Boo, way more than you can expect from this

macro R(e as int):for i in range(9**e):yield R.Body
x = 0
R 99:++x
  • This looks like Mason Wheeler's answer with a few small changes (??). Did you reach the same answer independently or is there something important in the values you changed (if so, please edit the answer to explain why they are important). – Dave Oct 24 '17 at 17:20

Python 3:


Tetration bomb

  • 2
    You should indicate how many bytes the output is, to see how your entry compares to others. – Sanchises Mar 29 at 9:09
  • Welcome to PPCG! It seems you've accidentally created two accounts and posted this answer twice. I've removed the other answer. As Sanchises said, this challenge is scored by the size of the compiled program. So you should include that size in your answer as it's the primary score. Also note that the actual program won't be very big, only the expression you're creating in memory, so you might want to think about a different approach. – Martin Ender Mar 29 at 10:34
  • @MartinEnder due to how Python evaluates some expressions at compile time and stores numbers in arbitrary precision, this will (in theory) have a rather a large executable. But as noted by Aleksi Torhamo (who used the same technique for part of his answer), this has a limit somewhere around 2GB, so I'd expect that this code as-written probably won't compile (though I haven't checked). If the OP can get it to compile and posts the compiled size (along with the command needed to generate it), then it's valid. The similarity to Aleksi's existing answer looks like coincidence to me. – Dave Mar 29 at 18:09

protected by Community Mar 29 at 10:34

Thank you for your interest in this question. Because it has attracted low-quality or spam answers that had to be removed, posting an answer now requires 10 reputation on this site (the association bonus does not count).

Would you like to answer one of these unanswered questions instead?

Not the answer you're looking for? Browse other questions tagged or ask your own question.