Golfcoder FAQ LOGIN
Error

Advent of Code Leaderboard 2025 / Day 5

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 113 54 59 19 days ago
2 Profile imageCornerMercury Python 128 66 62 19 days ago
3 Profile imageValentin Slawicek Kotlin 191 83 108 20 days ago
4 Profile imageVadzim Kapichenka Kotlin 214 88 126 20 days ago
5 Profile imageprogheal C++ 233 111 122 19 days ago
6 Profile imageAbbas Moosajee Python 264 105 159 21 days ago
7 Profile imageAkke C 295 122 173 19 days ago
8 Profile imageN. Adhikary Kotlin 10238 238 - 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.

238 tokens in Kotlin for part 1 by N. Adhikary

Download solution

funmain(){
valinput=generateSequence(::readLine).joinToString("\n").split("\n\n")
valranges=input[0].lines().map{val(a,b)=it.split("-").map(String::toLong)atob}.sortedBy{it.first}.toMutableList()
valids=input[1].trim().lines().map{it.toLong()}

valmerged=mutableListOf<Pair<Long,Long>>()
for((lo,hi)inranges){
if(merged.isNotEmpty()&&lo<=merged.last().second+1)
merged[merged.lastIndex]=merged.last().firsttomaxOf(merged.last().second,hi)
elsemerged.add(lotohi)
}

valp1=ids.count{i->merged.any{(lo,hi)->iinlo..hi}}
valp2=merged.sumOf{(lo,hi)->hi-lo+1}
println(p1)

}