Commit Briefs

9c7d442a8c Lukas Henkel

Day 12

diff | patch | tree

9320fac455 Lukas Henkel

Day 11

diff | patch | tree

7bd93562fa Lukas Henkel

Day 10

diff | patch | tree

fbf3f987e1 Lukas Henkel

Day 9

diff | patch | tree

db13595fbf Lukas Henkel

Day 8

diff | patch | tree

1af7fd644b Lukas Henkel

Inline some math

diff | patch | tree

dfca954de5 Lukas Henkel

Much faster recursive solution

diff | patch | tree

18c13061da Lukas Henkel

Optimize

diff | patch | tree

58c83f8af7 Lukas Henkel

Day 7

diff | patch | tree

b70c7b2a5c Lukas Henkel

Optimize

diff | patch | tree

db0986abd6 Lukas Henkel

Slight optimization

Check only the spots in task 2 where the guard visited in task 1

diff | patch | tree

c7c064a8bf Lukas Henkel

Day 6

diff | patch | tree

c5b1505128 Lukas Henkel

Split parsing

diff | patch | tree

1fa917d31e Lukas Henkel

Simplify

diff | patch | tree

eba1e3d671 Lukas Henkel

Day 5

diff | patch | tree

98f2d1afbb Lukas Henkel

Day 4

diff | patch | tree

e5bbdca6d8 Lukas Henkel

Fix tests

diff | patch | tree

35dfaacf78 Lukas Henkel

Use simple parser generator to generate a parser

This is quite a lot faster than using regex

diff | patch | tree

c8859bce66 Lukas Henkel

Import for asdf

diff | patch | tree

2b131a0c9c Lukas Henkel

Cleanup

diff | patch | tree

1fa9aa89ff Lukas Henkel

Add test

diff | patch | tree

f4702ab909 Lukas Henkel

Day 3

diff | patch | tree

5ebe82fbf8 Lukas Henkel

Optimize

diff | patch | tree

be08f67cde Lukas Henkel

Day 2

diff | patch | tree

7a47c795fe Lukas Henkel

Parse input in same loop

diff | patch | tree