Our great sponsors
-
-
TypeScript - Copied old code for grid movement and forgot to add [0, 0] to it, Part 2 for actual input takes around 100 seconds. I am using BFS, and also a maxTime heuristic, still could not make it better.
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
-
AdventOfCode
My Advent of Code solutions. I also upload videos of my solves: https://www.youtube.com/channel/UCuWLIm0l4sDpEe28t41WITA
Python3, 90/55. Video coming soon. Code.
-
AdventOfCode
Hacky solutions for [Advent of Code](https://adventofcode.com), working on past problems (by AllanTaylor314)
For part 1 my sneaky elves took a step north and then walked around the outside of the blizzard field. I trapped them in with additional walls \evil grin**
-
Python 171/176. Full code here; authentic code now, might clean later. Thought I was fast today, but you all are simply getting too good at this!
-
Python3 53x/52x
-
Elixir 455/529.
-
WorkOS
The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
-
AdventOfCode2022
Solutions to all 25 Advent of Code 2022 in Rust 🦀 Less than 100 lines per day, total runtime of less than 1 second. (by AxlLind)
Link to full solution (62 lines)
-
-
Link to solution
-
Python 3, GitHub, 76/57th
-
Ruby 369/332
-
-
Ruby, 84 lines, 1107/988
-
Python, 66/46. Video coming soon, code, basic visualization
-
C++ (911/753) Solution
-
adventofcode
My solutions for https://adventofcode.com/ programming mini puzzles - written mostly as sjasmplus script (to exercise the tool and collect ideas for future development of the script language, not because it's a best choice for the task, quite opposite) (by ped7g)
-
ultimatepp
U++ is a C++ cross-platform rapid application development framework focused on programmer's productivity. It includes a set of libraries (GUI, SQL, Network etc.), and integrated development environment (TheIDE).
U++ (C++ framework)
-
My Python code and the first I decided to submit this year. Why not?
-
-
Finally my implementation worked on the example but to my surprise and dismay it found no solution on the input. I eventually tried to see how close to the goal it got and realized that it did not take even one step. I had forgotten to consider that waiting in the starting position is possible
-
Scala: https://github.com/jurisk/advent-of-code/blob/main/scala2/src/main/scala/jurisk/adventofcode/y2022/Advent24.scala
-
-
My A* in Rust only stores (position, time) as state, as you can deduce where the blizzards are after N minutes: code. This is quite expensive, though, as you need to run it for each node expansion (unless you do caching).
-
-
Rust
-
-
Elixir code, thoughts
-
-
-
-
-
One speedup you can try is to precompute all the up/down/left/right arrays before A*. They will repeat themselves after height minutes (for up and down) and width minutes (for left and right). Then you can index this cache with the time value, which you could store in the state. Takes me ~2s for both parts code
-
Kotlin
-
JavaScript - 16s for part 1 and 33s for part 2.
-
your solution ported in C++
-
A* (heuristic based on manhattan distance to end goal) goes slightly faster than BFS, but most time goes in generating the blizzard cycles. Didn't bother too much to further optimize :P The main part of it in Python 3.11 below (the complete code on my github)
-
Rust
-
C#
-
-
Just a basic BFS. My part 2 ran in 1.77 seconds.
-
Python
-
Rust
-
Haskell
-
Yeah, it's what I thought too. But frankly, it took me all day to get this much out of my fogged brain, so I took the win I got.
-
-
For part 2 it was just a matter of adding recursion to go back and forth in the map, switching starting position and target each time: https://github.com/Convez/AdventOfCode2022/blob/main/day24/src/main.rs
-
Typescript
-
Javascript
-
Rust
-
-
JavaScript
-
-
Golang
-
-
Advent_of_Code
A repo revolving around attempting to solve the Advent of Code puzzles with single-statement t-sql (by adimcohen)
-
Zig (>12000/>12000)
-
Next I tried a parallel BFS, but hit two issues: early stopping threads is hard, and the overhead of threads seems significant compared to the tiny amount of work each thread can do before either synchronising or ending. So that wasn't going to get me the gains I needed, and besides, the exploration had revealed a much more lucrative approach - frontiers! By only considering the search frontier, I could easily make sure each node was unique, which made a huuuuuuge difference to run time.
-
advent-of-code-go
All 8 years of adventofcode.com solutions in Go/Golang; 2015 2016 2017 2018 2019 2020 2021 2022
-
SaaSHub
SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives
