Look at the README.md file for the given winner for information on how to compile the entry and how to run the winning program. Look at the winning source and try to figure how it does what it does! You may then wish to look at the Author's remarks for even more details.

The IOCCC has a web site and now has a number of international mirrors. The primary site can be found at https://www.ioccc.org/.

Use make(1) to compile entries. It is possible that on non-Unix / non-Linux systems the Makefile needs to be changed. See the Makefile for details.

This year we included most of the information included by the submitters in the README.md files.

Read over the Makefile for compile/build issues. Your system may require certain changes (add or remove a library, add or remove a #define).

Some ANSI C compilers are not quite as good as they should be. If yours is lacking, you may need to compile using gcc instead of your local compiler.

Remarks on some of the entries

We believe you will be impressed with this year's winners.

In particular:

The Abuse of the rules used local dictionary data to get around the size limit.
The Most beauteous visuals made clever use of {}s and whitespace in their source code and during execution.
The Most circuitous walk entry is just amazing.
The Best game makes full use of its single function.
The Best emulator may allow you to reconnect to your first PET.
Our Best of Show this year was simply (or non-simply :-) ) the best!
(And we need only mention (parenthetically speaking) that the best use of parenthesis is self reproducing).
The Most sonorous output might sound :-) like a good idea.
The Best 2D puzzle takes editorial license with expressions as well as the with the vi editor.
The Most ambiguous language winner is really a C program.
The Most superfluous output winner is simply Voronoi-lific!
Try not to have your sense of good coding offended by the Most discourteous interpreter winner.
The Best use of the www doesn't include those letters.
You will be puzzled by the Best 3D puzzle winner; we are sure!
The Most ingenious puzzle solution might puzzle you more while it puzzles out some puzzles: all in a puzzling way! :-)

Remarks on some of the losing entries

There were some outstanding entries that did not win. Unfortunately some very good entries lost because they:

depended too much on non-portable side effects in expressions; and/or
depended too much on a particular byte order; and/or
required the use of a special script, data file or pseudo-machine language that was not supplied with the entry.

We hope the authors of some of those entries will fix and resubmit them for the next IOCCC.

Final Comments

IMPORTANT NOTE: See contact.html for up to date contact details as well as details on how to provide fixes to any of the entries. See also the IOCCC FAQ for addition information on the IOCCC.

Copyright and License

Copyright (c) 2005,2023, Landon Curt Noll and Leonid A. Broukhis. All Rights Reserved. This work is licensed under a Creative Commons CC BY-SA 4.0 DEED Attribution-ShareAlike 4.0 International license. If you do use this work in some form, the IOCCC judges would appreciate (but does not require) if you were to send us a note about your use.