Advent of Code Leaderboard 2025 / Day 6

Submit solution

Leaderboard

	Name	Language	Tokens Sum	Tokens Part 1	Tokens Part 2	Last change
1	Vadzim Kapichenka	Kotlin	258	114	144	13 hours ago
2	Abbas Moosajee	Python	284	93	191	7 hours ago
3	Akke	C	405	186	219	11 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.

219 tokens in C for part 2 by Akke

Download solution

main()
{
charlines[10][9999],buf[10];
longn=0,m=0,ret=0,val1=0,val2=1,i,j;

for(n=0;gets(lines[n]);n++)
m=m>strlen(lines[n])?m:strlen(lines[n]);

for(j=m-1;j>-1;j--){
for(i=0;i<n-1;i++)
buf[i]=isdigit(lines[i][j])?lines[i][j]:' ';
buf[i]='\0';
val1=atol(buf)?val1+atol(buf):0;
val2=atol(buf)?val2*atol(buf):1;
ret+=!(43-lines[n-1][j])*val1+!(42-lines[n-1][j])*val2;
}
printf("%lu\n",ret);
}