Advent of Code Leaderboard 2025 / Day 1

Submit solution

Leaderboard

	Name	Language	Tokens Sum	Tokens Part 1	Tokens Part 2	Last change
1	Frederik Bonfanti	Ruby	67	31	36	25 days ago
2	CornerMercury	Python	91	43	48	19 days ago
3	N. Adhikary	Python	95	45	50	20 days ago
4	Allan Taylor	Python	95	45	50	25 days ago
5	Benjamin Groves	Python	98	46	52	25 days ago
6	Abbas Moosajee	Python	114	55	59	24 days ago
7	Michael Böiers	Kotlin	117	54	63	23 days ago
8	progheal	C++	127	53	74	24 days ago
9	Hannah Lenk	C++	139	57	82	24 days ago
10	Akke	C	149	74	75	25 days ago
11	Valentin Slawicek	Kotlin	155	61	94	23 days ago
12	Jordan Perry	Python	160	67	93	25 days ago
13	Lafazar	Python	180	82	98	24 days ago
14	Vadzim Kapichenka	Kotlin	189	76	113	23 days ago
15	Norbert Kiesel	Kotlin	201	80	121	25 days ago
16	Olivier Mengué	TypeScript	10090	90	-	19 days ago
17	N. Adhikary	Kotlin	10106	106	-	12 days ago
18	N. Adhikary	Rust	10156	156	-	12 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.

156 tokens in Rust for part 1 by N. Adhikary

Download solution

usestd::io::{self,BufRead};

fnmain(){
letstdin=io::stdin();
letmutpos:i32=50;
let(mutp1,mutp2)=(0,0);
forlineinstdin.lock().lines().flatten(){
letd=line.chars().next().unwrap();
letn:i32=line[1..].parse().unwrap();
for_in0..n{
pos=(pos+ifd=='L'{-1}else{1}).rem_euclid(100);
ifpos==0{p2+=1;}
}
ifpos==0{p1+=1;}
}
println!("{}",p1);
}