Advent of Code Leaderboard 2024 / Day 4

Submit solution

Leaderboard

	Name	Language	Tokens Sum	Tokens Part 1	Tokens Part 2	Last change
1	CornerMercury	Python	235	110	125	10 months ago
2	Mechazawa	JavaScript	242	128	114	10 months ago
3	Michael Böiers	Kotlin	323	174	149	10 months ago
4	dbasden	C	380	224	156	11 months 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.

224 tokens in C for part 1 by dbasden

Download solution

#include<stdio.h>

charbss_abuse[1024];
chargrid[256][256];

intivecs[]={-1,-1,-1,0,0,1,1,1,-1,0,1,-1,1,-1,0,1};
intwidth,height,part1,i;
intmain(){
while(scanf("%s%n",&(grid[++height][0]),&width)==1);
while(i++<height)
for(intj=0;j<width;++j)
for(intn=0;n<8;++n)
part1+=grid[i][j]==88&&grid[i+ivecs[n]][j+ivecs[n+8]]==77&&grid[i+ivecs[n]*2][j+ivecs[n+8]*2]==65&&grid[i+ivecs[n]*3][j+ivecs[n+8]*3]==83;
returnprintf("%d",part1)<0;
}