Golfcoder FAQ LOGIN
Error

Advent of Code Leaderboard 2025 / Day 1

View puzzle on adventofcode.com

Submit solution



Leaderboard

Name Language Tokens Sum Tokens Part 1 Tokens Part 2 Last change
1 Profile imageFrederik Bonfanti Ruby 67 31 36 5 days ago
2 Profile imageN. Adhikary Python 95 45 50 21 hours ago
3 Profile imageAllan Taylor Python 95 45 50 5 days ago
4 Profile imageBenjamin Groves Python 98 46 52 5 days ago
5 Profile imageAbbas Moosajee Python 114 55 59 4 days ago
6 Profile imageMichael Böiers Kotlin 117 54 63 3 days ago
7 Profile imageprogheal C++ 127 53 74 4 days ago
8 Profile imageHannah Lenk C++ 139 57 82 4 days ago
9 Profile imageAkke C 149 74 75 5 days ago
10 Profile imageValentin Slawicek Kotlin 155 61 94 3 days ago
11 Profile imageJordan Perry Python 160 67 93 5 days ago
12 Profile imageLafazar Python 180 82 98 4 days ago
13 Profile imageVadzim Kapichenka Kotlin 189 76 113 3 days ago
14 Profile imageNorbert Kiesel Kotlin 201 80 121 5 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.

94 tokens in Kotlin for part 2 by Valentin Slawicek

Download solution

importkotlin.math.sign

funmain(){
varzeroCounter=0
varcurrentPos=50
generateSequence(::readLine).forEach{
valoffset=it.replace("L","-").replace("R","").toInt()
repeat(offset*offset.sign){
currentPos=(currentPos+offset.sign).mod(100)
if(currentPos==0)zeroCounter++
}
}
println(zeroCounter)
}