Advent Of Code

1199 readers

3 users here now

An unofficial home for the advent of code community on programming.dev! Other challenges are also welcome!

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.

Everybody Codes is another collection of programming puzzles with seasonal events.

AoC 2025

Solution Threads

M	T	W	T	F	S	S
1	2	3	4	5	6	7
8	9	10	11	12

Visualisations Megathread

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

Advent of Code Homepage

Credits

Icon base by Lorc under CC BY 3.0 with modifications to add a gradient

console.log('Hello World')

founded 2 years ago

MODERATORS

Ategon@programming.dev

Sigmatics@lemmy.ca

CameronDev@programming.dev

hades@programming.dev

👪 - 2025 DAY 7 SOLUTIONS - 👪 (programming.dev)

submitted 2 weeks ago by CameronDev@programming.dev to c/advent_of_code@programming.dev

29 comments fedilink hide all child comments

Day 7: Laboratories

Megathread guidelines

Keep top level comments as only solutions, if you want to say something other than a solution put it in a new post. (replies to comments can be whatever)
You can send code in code blocks by using three backticks, the code, and then three backticks or use something such as https://topaz.github.io/paste/ if you prefer sending it through a URL

FAQ

What is this?: Here is a post with a large amount of details: https://programming.dev/post/6637268
Where do I participate?: https://adventofcode.com/
Is there a leaderboard for the community?: We have a programming.dev leaderboard with the info on how to join in this post: https://programming.dev/post/6631465

you are viewing a single comment's thread
view the rest of the comments

[–] Quant@programming.dev 1 points 2 weeks ago* (last edited 2 weeks ago)

Uiua

Part 1 was fun, though I had quite some frustration with getting the loop work the way I wanted it to.
For part 2 I didn't actually need to modify that much, just pass another function to deal with the list of tachyons: part 1, remove duplicates, part 2, don't remove and count at the end. Easy. Or so I thought.
I realized something was wrong when it just wouldn't stop running and the fan got louder.

Today I started over from scratch and decided to solve both parts at once since I basically got the counts for each row anyways, so I just had to change the way the splitting was handled.
There was one occasion where I got an error that the resulting array would be too big (~4GB) but at least I got a warning instead of seeing RAM usage spike suddenly :P

Run with example input

Code

$ .......S.......
$ ...............
$ .......^.......
$ ...............
$ ......^.^......
$ ...............
$ .....^.^.^.....
$ ...............
$ ....^.^...^....
$ ...............
$ ...^.^...^.^...
$ ...............
$ ..^...^.....^..
$ ...............
$ .^.^.^.^.^...^.
$ ...............
# &fras "input-7.txt" ◌
⊜∘⊸≠@\n
⊃(=@S⊡₀)(⊏⊚>0⊸≡/+=@^↘₂)
ShootSplit ← (
  ⤚(=2+>0)
  ⧻⊸⊚
  ⊙(⟜₂(
      ⟜⊏⊚⊙⟜[⧻]
      ⍚(⊂⊃-₁+₁)
      /+≡⌟(⬚0˜↯×◇°⊚)
    )
    +⍜⊏(˜↯0⧻)⊚
  )
)

Solve ← (
  0
  ⍥(⊙(+|ShootSplit|⊃⊡₀↘₁))◡⋅⋅⧻
  ⊟⊙⊙◌⊙/+
)

Solve
≡(&p $"Part _: _") 1_2

And for completeness sake:

Previous attempt

Edit: Tried to scrape the old code together but seems like it doesn't actually work like this. Probably just some small thing I missed but I don't have the mental energy to take a look at this mess again :P

Prep ← ⊃(⊚=@S)⊜∘⊸≠@\n

Splits! ← (
  ˙⍤>0◡⋅⧻
  ⤚(=⧻⤙˜⨂)
  ∩⌟▽⊸¬
  ⊸⧻
  ⊙(♭≡[⊃-₁+₁]
    ^⊂)
)

Shoot! ← (
  0
  ⍢(⊙(+
    | ⍣Splits!^⊸⋅0
    | ⊚=@^°⊂
    )
  | >0⋅⋅⧻)
)

PartOne ← (
  &fras "input-7.txt"
  Prep
  ⊙⋅◌Shoot!◴
)

PartTwo ← (
  &fras "input-7.txt"
  Prep
  ⧻⋅⊙◌Shoot!∘
)