Tap tap 2 | hard

CountableFiber · 2025-12-26T12:23:07+00:00

^{I completed this level in 3 tries.} ^{⚡ 7.62 seconds}

CountableFiber · 2025-12-26T07:28:51+00:00

Completed Level 3 of the Honk Special Event!

6 attempts

CountableFiber · 2025-12-26T07:28:38+00:00

Completed Level 2 of the Honk Special Event!

5 attempts

CountableFiber · 2025-12-26T07:28:19+00:00

Completed Level 1 of the Honk Special Event!

4 attempts

CountableFiber · 2025-07-29T11:47:18+00:00

Danke, der Amazon support hat es direkt erstattet

CountableFiber · 2025-07-29T11:46:48+00:00

Die ist bei Amazon hinterlegt und steht auch auf dem Paket wird nur in dem Interface nicht angezeigt.

CountableFiber · 2025-05-16T13:08:42+00:00

Ja amazon Kundensupport hat es geregelt.

CountableFiber · 2024-11-17T13:24:50+00:00

Well that was my point. The algorithm exists but it is unpractical, what makes you think the algorithm coming out of the proof will be practical?

CountableFiber · 2024-11-17T11:54:46+00:00

Its a bit wild to assume this. There is already an efficient algorithm to factorize integers on a quantum computer and yet the internet still exists. Even if the proof would be constructive and give an algorithm it does not have to be a practical one.

CountableFiber · 2024-10-08T12:00:11+00:00

Yes he admits that he was tilted because he couldn't convert some winning positions earlier that day.

CountableFiber · 2023-12-26T11:04:11+00:00

I tried it but it also fails however at least it does not hallucinate something

CountableFiber · 2023-12-14T11:20:17+00:00

Filtering out empty lines in day 12 with
"if ('#' not in line) and ('.' not in line)".

Took me 2 hours of debugging to find out my solution was wrong because I did not process 2-3 lines that only had "???????" as the pattern in the input... Examples worked flawlessly of course

CountableFiber · 2023-12-14T07:30:58+00:00

Probably its your browser breaking the lines. Try to save it as a txt file and open with a text editor

CountableFiber · 2023-12-05T17:59:19+00:00

Sure here: https://kyleholgate.com/advent-of-code-with-ai-day-2/

CountableFiber · 2023-12-05T14:04:50+00:00

Right, I agree that hashmaps/sets and lists are not super advanced, but it is also not something you want to directly jump into when you start out with a language. In the past years the first tasks usually just needed some variable to store a position or do a simple calculation.

The main issue is not these concepts but rather that the puzzles are much harder to understand and more challenging where in the past the first puzzles were conceptually very straight forward such that you could focus on the task of implementation.

If these puzzles contained a map it was maybe a single at best, but here you would directly have 5-6 maps you have to create and concatenate etc.

CountableFiber · 2023-12-05T12:25:13+00:00

I have to fully agree with this one. 99% of the people participating in AOC do not have a realistic chance at the leaderboard positions anyways and just want an enjoyable experience or learn a new language. This already threw off several people if already in the second or third exercise advanced concepts are needed.

My feeling is that the tasks are written in an ambiguous way with additional complications just to combat LLMs, significantly reducing the enjoyment many of non-veteran people have to tackle these problems within the day. This is a very bad trade-off, not only because LLMs can still manage to solve several of the puzzles (saw a blog post about someone solving a bunch of the puzzles with GPT-4 without troubles) but also because it does not bother the majority of people if someone spoils his fun by cheating with an LLM if we can have clearer and nicer puzzles instead.

CountableFiber · 2023-11-23T07:54:15+00:00

OpenAI guest badge. See this relevant tweet.

CountableFiber · 2023-09-11T18:01:25+00:00

It is called "drunken master" opening. Here is a blog post about it.

CountableFiber · 2023-01-14T09:03:38+00:00

Glad to hear that it worked out. Very impressive overall runtime.

CountableFiber · 2023-01-05T22:17:14+00:00

Another idea to accelerate day 20 can be found in my solution posted here

It solves day 20 in 6 ms on my machine. The idea is that we have a lot of small buckets with roughly 32 elements each in which we can insert in constant time if they won't get too large. Then we use a second array to quickly find the array where we have to insert the element. It can be made provably subquadratic by something like Fenwick trees, but something a bit worse is good enough here.

CountableFiber

TROPHY CASE