BarrCodes

“The One Billion Row Challenge” is a programming challenge originally written for Java, where the goal is to summarize a billion rows of temperature measurements as fast as possible.

The chief historian is nowhere to be found, going back to his office, it appears to be locked, and North Pole Security doesn’t know which key is correct.

The elves monitoring device is malfunctioning, and as always, its my job to figure out what went wrong.

Today’s challenge is about finding cliques in a graph constructed from a list of edges, that together make up a computer network.

Monkeys are buying hiding spots at a psudo-random price, which I need to predict to maximize profit.

The goal is simple: input a code into a numpad, using a robot, that is controlled by another robot, that is controlled by another robot…

Maze solving has gotten boring even for these robots, so they started cheating.

Today’s goal is finding whether(and later, in how many ways) can striped towels be arranged in various patterns.

Today’s challenge involves reaching the end of a maze, a simple request, until it starts changing in part 2.

Part 1 has a simple program to interpret, part 2 makes it a lot more complex.

Today’s challenge is just a maze, but turning has a cost.

A warehouse robot has gone crazy and is moving and pushing boxes at random, the goal is to track the boxes.

Just tracking some robots moving in diagonal lines, how bad could it be?

Today’s challenge describes a set of claw machines that are controlled by 2 buttons, and the goal is to win as many prizes as possible with as little money as possible.

The Elves are trying to build fences for their gardens and need me to calculate the cost.

Part 1 starts of with a simple problem to solve naively, part 2 makes the solution unfeasible.

Today’s challenge is a simple pathfinding one: find trails in increasing heights on a topological map.

An elf is trying to compact the files on his computer.

Antennas now make people buy more chocolate, but only in “antinodes”, so they need to be found and counted.

Appearently elephents can still math operators and I need to fix it.

Today the goal is tracking a guard that is going on a patrol route and turning right every time he encounters an obstacle, until he is off the grid.

Today’s challenge involves first parsing a set of rules, and then checking which lines in the rest of the input matches the rules.

Seems like these challenges mostly don’t involve searching for this missing historian(does anyone even notice the lore for these?)

Today’s challenge involves parsing and executing math instructions, surrounded by a lot of garbage data.

Second day, this time we’ve got a classic “one mistake allowed” challenge for part 2.

Another year, another set of challenges from Advent of Code, and once again I will attempt to solve them all using Rust.

In this post I will answer ShoddyCast’s challenge and simulate Pokemon battles looking for an extremely rare sequence of results that can save a theoretical game save from a softlock using Rust, and later, also CUDA.

For a long time I wanted to write more code, but didn’t have a good reason to.

I’m an MSc student in Computer Science interested in distributed computing, Rust, and high performance code in general.