David Betteridge

Do you want the name of an algorithm to research?

It was fun trying to speed up Part 2 of Day 6. I'm down to about 57ms (in c#) but stuck for ideas for now...!

#AdventOfCode. #csharp

A friend of mine's Rust solution is here:
github.com/cmaughan/aoc...
This sort of thing

let mut tokens = Vec::new();
while self.position < self.input.len() {
let c = self.input[self.position..].chars().next().unwrap();
if c.is_whitespace() {
self.position += c.len_utf8();

what language are you using?

I would keep track of the state you are in.
Start in state=0,
Parse mul( and you are now in state 1
If you see a number, and you are in state 1 then ....

Day 3

I like the speed of the GeneratedRegex source code generators in .net :-)

Part1: 130.9 us. (502.72 KB)
Part2: 125.5 us. (476.02 KB)

#AdventOfCode

I was pleased to be able to use C#'s SearchValues and SplitAny functions in Day 1 of Advent of Code.

:-)

#AdventOfCode