this post was submitted on 07 Dec 2024
22 points (89.3% liked)
Advent Of Code
920 readers
86 users here now
An unofficial home for the advent of code community on programming.dev!
Advent of Code is an annual Advent calendar of small programming puzzles for a variety of skill sets and skill levels that can be solved in any programming language you like.
AoC 2024
Solution Threads
M | T | W | T | F | S | S |
---|---|---|---|---|---|---|
1 | ||||||
2 | 3 | 4 | 5 | 6 | 7 | 8 |
9 | 10 | 11 | 12 | 13 | 14 | 15 |
16 | 17 | 18 | 19 | 20 | 21 | 22 |
23 | 24 | 25 |
Rules/Guidelines
- Follow the programming.dev instance rules
- Keep all content related to advent of code in some way
- If what youre posting relates to a day, put in brackets the year and then day number in front of the post title (e.g. [2024 Day 10])
- When an event is running, keep solutions in the solution megathread to avoid the community getting spammed with posts
Relevant Communities
Relevant Links
Credits
Icon base by Lorc under CC BY 3.0 with modifications to add a gradient
console.log('Hello World')
founded 1 year ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Since all operations increase the accumulator, I tried putting a
guard (a <= x)
inapply
, but it doesn't actually help all that much (0.65s -> 0.43s).0.65 -> 0.43 sounds pretty strong, isn't that a one-fourth speedup?
Edit: I was able to achieve a 30% speed improvement using this on my solution
It's not insignificant, sure, but I'd prefer 10x faster :D
Plus I'm not sure it's worth the loss of generality and readability. It is tempting to spend hours chasing this kind of optimization though!