Research any topic before you write.
Find related topics. | Discover entities. | See connections. | Build a topical map.
The International Obfuscated C Code Contest (abbreviated IOCCC) is a computer programming contest for code written in C that is the most creatively obfuscated and held annually (when possible). It is described as "celebrating C's syntactical opaqueness". The winning code for the 28th contest, held in 2025/26, was announced by live stream 6 June 2026.
The analysis highlights History, Examples and Obfuscations employed as prominent areas in the source structure around International Obfuscated C Code Contest.
Source areas are shown by the number of related topics found in each part of the analysis. Use smaller areas too: they can reveal specialized angles and content gaps.
Smaller areas are not necessarily less important. They contain fewer connections in this analysis and can be useful for finding specialized angles or coverage gaps.
High-confidence facts extracted from structured source data. Use them as anchors for further research.
Browse the complete topic structure, not only the most central items. Less prominent entities and concepts can reveal missing angles, specialized context and useful research gaps. Each item opens a new analysis centered on that subject.
Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.
The extracted context around International Obfuscated C Code Contest shows recurring relationship patterns in the source. For example, International Obfuscated C Code Contest → Landon Curt Noll, Larry Bassel Another extracted example is International Obfuscated C Code Contest → Semi-annually. Use these groups to spot repeated connection types before inspecting the individual relationships.
Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.
contest code ioccc entries source rules winning website written toledo obfuscated entry programming held announced nanochess years 1984 2011 size
TTTA extracted 9 structured relationships around International Obfuscated C Code Contest. Examples in this analysis include International Obfuscated C Code Contest → Founders → Landon Curt Noll, Larry Bassel and International Obfuscated C Code Contest → Frequency → Semi-annually. The table shows each extracted connection, where it came from and its confidence.
| Subject | Predicate | Object | Confidence | Src |
|---|---|---|---|---|
| International Obfuscated C Code Contest | Founders | Landon Curt Noll, Larry Bassel | 1.00 | infobox |
| International Obfuscated C Code Contest | Frequency | Semi-annually | 1.00 | infobox |
| International Obfuscated C Code Contest | Genre | Coding contest | 1.00 | infobox |
| International Obfuscated C Code Contest | Inaugurated | 1984 (1984) | 1.00 | infobox |
| International Obfuscated C Code Contest | Most recent | 2025 | 1.00 | infobox |
| International Obfuscated C Code Contest | Next event | Dec 2026 | 1.00 | infobox |
| International Obfuscated C Code Contest | Status | Active | 1.00 | infobox |
| International Obfuscated C Code Contest | Website | www.ioccc.org | 1.00 | infobox |
| International Obfuscated C Code Contest | Years active | 1984–1996, 1998, 2000, 2001, 2004–2006, 2011–2015, 2018–2020, 2024-2025 | 1.00 | infobox |
The concept neighborhoods around International Obfuscated C Code Contest bring nearby vocabulary together. In this analysis, examples include Programming, Winner and Entry. Use the clusters to find adjacent concepts and terminology that may deserve separate research.
For International Obfuscated C Code Contest, one of the stronger structural bridges in this analysis connects International Obfuscated C Code Contest with Examples. Bridges highlight paths between different parts of the map and can reveal research angles that are easy to miss in a flat list.
TTTA analyzes the structure around International Obfuscated C Code Contest to surface related topics, entities, relationships, concept neighborhoods and bridge connections. Use the map to explore areas such as History, Examples & Obfuscations employed, including less central topics that may reveal useful research gaps. Automatically extracted connections are research leads rather than rewritten encyclopedia content.
Source: Wikipedia — International Obfuscated C Code Contest · EN edition · Analysis: TopicsToTalkAbout