Advent of Code Leaderboard 2023 / Day 2

Submit solution

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), 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.

Code publicly visible

Leaderboard

	Name	Language	Tokens Sum	Tokens Part 1	Tokens Part 2	Last change
1	LiquidFun	Python	146	88	58	9 months ago
2	anonymous	Kotlin	227	123	104	10 months ago
3	Mustafa Furkan Kaptan	Python	313	170	143	10 months ago
4	Valentin Slawicek	Kotlin	404	221	183	10 months ago

170 tokens in Python for part 1 by Mustafa Furkan Kaptan

Download solution

importre

t,i=0,0
try:
whilel:=input():
s,v=l[l.index(":"):].split(";"),True
forwins:
f=lambdac:int(re.findall(f"(\d+) {c}",w)[0])
r=f("red")<13if"d"inwelse1
g=f("green")<14if"n"inwelse1
b=f("blue")<15if"b"inwelse1
v&=all((r,g,b))
ifv:
t+=i+1
i+=1
except:
print(t)