{"id":34850758,"url":"https://github.com/wrightdylan/advent-of-code-2025","last_synced_at":"2026-05-15T16:34:47.813Z","repository":{"id":328166942,"uuid":"1106649284","full_name":"wrightdylan/advent-of-code-2025","owner":"wrightdylan","description":"🎄 Advent of Code 2025 in Rust 🎄","archived":false,"fork":false,"pushed_at":"2025-12-15T10:01:37.000Z","size":69,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-12-27T04:10:23.990Z","etag":null,"topics":["advent-calendar","advent-of-code","advent-of-code-2025","aoc","aoc-2025","aoc-2025-in-rust","code-challenges","problem-solving","rust","rust-lang"],"latest_commit_sha":null,"homepage":"https://adventofcode.com/2025","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/wrightdylan.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2025-11-29T17:03:51.000Z","updated_at":"2025-12-15T10:01:41.000Z","dependencies_parsed_at":null,"dependency_job_id":null,"html_url":"https://github.com/wrightdylan/advent-of-code-2025","commit_stats":null,"previous_names":["wrightdylan/advent-of-code-2025"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/wrightdylan/advent-of-code-2025","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wrightdylan%2Fadvent-of-code-2025","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wrightdylan%2Fadvent-of-code-2025/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wrightdylan%2Fadvent-of-code-2025/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wrightdylan%2Fadvent-of-code-2025/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/wrightdylan","download_url":"https://codeload.github.com/wrightdylan/advent-of-code-2025/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wrightdylan%2Fadvent-of-code-2025/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33072562,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-15T11:35:32.926Z","status":"ssl_error","status_checked_at":"2026-05-15T11:35:31.362Z","response_time":103,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["advent-calendar","advent-of-code","advent-of-code-2025","aoc","aoc-2025","aoc-2025-in-rust","code-challenges","problem-solving","rust","rust-lang"],"created_at":"2025-12-25T19:13:30.386Z","updated_at":"2026-05-15T16:34:47.807Z","avatar_url":"https://github.com/wrightdylan.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# :gift::christmas_tree: Advent of Code 2025 :christmas_tree::sparkles:\n\nThese are my solutions to this year's [Advent of Code](https://adventofcode.com/2025/).\n\nSolutions make use of `cargo-aoc` code helper ([here](https://github.com/gobanos/cargo-aoc)).\n\n## Solutions\n\nAll solutions linked below:\n| Day | Title | 1 :star: | 2 :star: | Solution | Rating |\n|:-|:-|:-|:-|:-|:-|\n| [01](https://adventofcode.com/2025/day/1)  | Secret Entrance                 | 5.49µs | 27.0µs | [day01.rs](./src/day01.rs) | :sunglasses: |\n| [02](https://adventofcode.com/2025/day/2)  | Gift Shop                       | 17.4ms | 34.0ms | [day02.rs](./src/day02.rs) | :smirk: |\n| [03](https://adventofcode.com/2025/day/3)  | Lobby                           | 168µs  | 2.86ms | [day03.rs](./src/day03.rs) | :astonished: |\n| [04](https://adventofcode.com/2025/day/4)  | Printing Department             | 3.45ms | 12.6ms | [day04.rs](./src/day04.rs) | :persevere: |\n| [05](https://adventofcode.com/2025/day/5)  | Cafeteria                       | 298µs  | 8.43µs | [day05.rs](./src/day05.rs) | :scream: |\n| [06](https://adventofcode.com/2025/day/6)  | Trash Compactor                 | 3.57µs | 72.8µs | [day06.rs](./src/day06.rs) | :no_mouth: |\n| [07](https://adventofcode.com/2025/day/7)  | Laboratories                    | 102µs  | 275µs  | [day07.rs](./src/day07.rs) | :anguished: |\n| [08](https://adventofcode.com/2025/day/8)  | Playground                      | 2.53ms | 4.35ms | [day08.rs](./src/day08.rs) | :confounded: |\n| [09](https://adventofcode.com/2025/day/9)  | Movie Theater                   | 130µs  | 2.12ms | [day09.rs](./src/day09.rs) | :cry: |\n| [10](https://adventofcode.com/2025/day/10) | Factory                         | 1.10ms | 59.7ms | [day10.rs](./src/day10.rs) | :angry: |\n| [11](https://adventofcode.com/2025/day/11) | Reactor                         | 4.88µs | 42.3µs | [day11.rs](./src/day11.rs) | :fearful: |\n| [12](https://adventofcode.com/2025/day/12) | Christmas Tree Farm             | 6.34µs | :gift: | [day12.rs](./src/day12.rs) | :grimacing: |\n\n## Notes\n1. I'll revisit day 2 again as I think I can improve the algorithm.\n2. It took a few optimisations to get day 3 part 2 to single digit ms.\n3. Solutions should be run in both development and release profiles to see timing differences.\n4. Day 4 part 2 was a tough one to run in parallel.\n5. Day 5 initially required 4.9TB of RAM. Fortunately there was another data structure to the rescue.\n6. Day 6 part 1 was pretty standard. Part 2 could have been easier, but I wanted a unified solution for both parts.\n7. I sometimes struggle with recursive functions.\n8. Day 8 had far too many false starts.\n9. Day 9, part 2, could possibly run a bit faster by using [coordinate compression](https://medium.com/algorithms-digest/coordinate-compression-2fff95326fb).\n10. Day 9, part 2, now incorporates coordinate compression. This has dropped run time from 378ms to 2.12ms. The original took 19s single threaded.\n11. Major dislike of having to resort to using z3.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwrightdylan%2Fadvent-of-code-2025","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwrightdylan%2Fadvent-of-code-2025","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwrightdylan%2Fadvent-of-code-2025/lists"}