Advent of Code Leaderboard 2025 / Day 11

Submit solution

Leaderboard

	Name	Language	Tokens Sum	Tokens Part 1	Tokens Part 2	Last change
1	Livi	Python	207	83	124	4 days ago
2	Vadzim Kapichenka	Kotlin	308	109	199	15 days ago
3	Akke	C	450	159	291	26 hours ago

Rules

You're welcome to participate alone or in a team.
You may submit multiple solutions and explore different programming languages.
Stick to the standard library of your language, no further dependencies/libraries, except the ones which OneCompiler provides (e.g. NumPy for Python).
Ensure your code aligns to the template (Python, Rust, Go, Kotlin, JavaScript, C#, TypeScript, C++, Java, C, Swift, Scala, Ruby, Bash), reading the puzzle input from stdin (terminated with end-of-file), and printing the solution to stdout.
Please refrain from making network requests, reading data from files, or storing data in variable/function/class names for reflection.
Your code must be able to process all valid Advent of Code inputs. Golfcoder might reevaluate correctness of your solution with different inputs after your submission.

159 tokens in C for part 1 by Akke

Download solution

#include<string.h>

main()
{
longn=0,m=1,count=0,i,j;
charbuf[1000][1000],find[1000][1000]={"you"};
while(gets(buf[n++])){}

while(m--){
for(i=0;strncmp(buf[i],find[m],3);)i++;
for(j=5;j<strlen(buf[i]);j+=4)
!strncmp(buf[i]+j,"out",3)?count++:strncpy(find[m++],buf[i]+j,3);
}
printf("%ld\n",count);
}