Advent of Code Leaderboard 2025 / Day 3

Submit solution

Leaderboard

	Name	Language	Tokens Sum	Tokens Part 1	Tokens Part 2	Last change
1	Frederik Bonfanti	Ruby	117	43	74	3 days ago
2	DXDimitri	Python	131	56	75	2 days ago
3	Vadzim Kapichenka	Kotlin	151	71	80	3 days ago
4	Abbas Moosajee	Python	154	77	77	3 days ago
5	N. Adhikary	C++	182	90	92	20 hours ago
6	Valentin Slawicek	Kotlin	187	60	127	3 days ago
7	progheal	C++	218	102	116	3 days ago
8	Akke	C	243	111	132	3 days ago
9	Calvin Dang	JavaScript	10118	-	118	3 days ago

Solutions with 1 unsolved part get a penalty of 10000 tokens (indicated with "-").

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.

111 tokens in C for part 1 by Akke

Download solution

#include<stdio.h>
#include<string.h>

intmain(void)
{
charbuf[999];
size_tret=0,max,i,j;
for(max=0;gets(buf);ret+=max-528)
for(max=0,i=0;i<strlen(buf);i++)
for(j=0;j<i;j++)
if(buf[j]*10+buf[i]>max)
max=buf[j]*10+buf[i];
printf("%lu\n",ret);
}