Advent of Code Leaderboard 2025 / Day 7

Submit solution

Leaderboard

	Name	Language	Tokens Sum	Tokens Part 1	Tokens Part 2	Last change
1	CornerMercury	Python	148	72	76	19 days ago
2	Frederik Bonfanti	Ruby	179	71	108	19 days ago
3	progheal	C++	237	111	126	19 days ago
4	Valentin Slawicek	Kotlin	251	118	133	19 days ago
5	Vadzim Kapichenka	Kotlin	293	149	144	19 days ago
6	Olivier Mengué	Go	309	153	156	18 days ago
7	Olivier Mengué	TypeScript	314	138	176	18 days ago
8	Abbas Moosajee	Python	314	157	157	19 days 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.

176 tokens in TypeScript for part 2 by Olivier Mengué

Download solution

constlines=require('fs').readFileSync(0,'utf8').split('\n');

constmakeBeams=()=>newArray<number>(lines[0].length).fill(0);
letbeams=makeBeams();
beams[lines.shift().indexOf("S")]=1;

letnbBeams=1;

for(constrowoflines){
constnewBeams=makeBeams();
for(letb=0;b<beams.length;b++){
constn=beams[b];
if(n==0)continue;
if(row[b]==="^"){
newBeams[b-1]+=n;
newBeams[b+1]+=n;
nbBeams+=n;
}else{
newBeams[b]+=n;
}
}
beams=newBeams;
}

console.log(nbBeams);