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 47 hours ago
2 Profile imageCornerMercury Python 128 66 62 2 days ago
3 Profile imageValentin Slawicek Kotlin 191 83 108 2 days ago
4 Profile imageVadzim Kapichenka Kotlin 214 88 126 2 days ago
5 Profile imageprogheal C++ 233 111 122 44 hours ago
6 Profile imageAbbas Moosajee Python 264 105 159 3 days ago
7 Profile imageAkke C 295 122 173 46 hours 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.

173 tokens in C for part 2 by Akke

Download solution

#include<sys/param.h>
main()
{
longret,n,los[2000],his[2000],i,j;
while(scanf("%ld-%ld",&los[n],&his[n])-1)
n++;
while(i<n){
for(j=i+1;MAX(los[i],los[j])>MIN(his[i],his[j])&j<n;j++){}
if(j-n)
los[j]=MIN(los[j],los[i]),
his[j]=MAX(his[j],his[i]);
else
ret+=his[i]-los[i]+1;
i++;
}
printf("%lu",ret);
}