git.entf.net

Commits

Commit:: 9c7d442a8c160ee59e815001d865082616b8bfdc
From:: Lukas Henkel <lh@entf.net>
Date:: Thu Dec 12 06:29:49 2024 UTC

Day 12

diff | patch | tree

Commit:: 9320fac455489ef7263b15f3a6336c7ed34a7934
From:: Lukas Henkel <lh@entf.net>
Date:: Wed Dec 11 05:58:49 2024 UTC

Day 11

diff | patch | tree

Commit:: 7bd93562fa1827db036c3b25cfe787b809b12669
From:: Lukas Henkel <lh@entf.net>
Date:: Tue Dec 10 05:24:32 2024 UTC

Day 10

diff | patch | tree

Commit:: fbf3f987e153a05c6fed487dfd94c2ce5677b575
From:: Lukas Henkel <lh@entf.net>
Date:: Mon Dec 9 06:54:47 2024 UTC

Day 9

diff | patch | tree

Commit:: db13595fbfe221cdbdfbe5dd8134ed28f25c8f71
From:: Lukas Henkel <lh@entf.net>
Date:: Sun Dec 8 05:48:58 2024 UTC

Day 8

diff | patch | tree

Commit:: 1af7fd644bbac6ad0c08078a59d37b095fbeca10
From:: Lukas Henkel <lh@entf.net>
Date:: Sat Dec 7 07:13:55 2024 UTC

Inline some math

diff | patch | tree

Commit:: dfca954de59ae6453cfc4e6aa21316dbe790a432
From:: Lukas Henkel <lh@entf.net>
Date:: Sat Dec 7 07:12:58 2024 UTC

Much faster recursive solution

diff | patch | tree

Commit:: 18c13061da0c7b642446e64b7dc1a561c3958fc0
From:: Lukas Henkel <lh@entf.net>
Date:: Sat Dec 7 06:24:51 2024 UTC

Optimize

diff | patch | tree

Commit:: 58c83f8af7c4abc47f02dc051fd17da85272eb0d
From:: Lukas Henkel <lh@entf.net>
Date:: Sat Dec 7 05:43:18 2024 UTC

Day 7

diff | patch | tree

Commit:: b70c7b2a5c6627168ec3652c3841e54b97f55bc5
From:: Lukas Henkel <lh@entf.net>
Date:: Fri Dec 6 18:11:53 2024 UTC

Optimize

diff | patch | tree

Commit:: db0986abd6d2a985fff0dd0baa13c97a708a6b53
From:: Lukas Henkel <lh@entf.net>
Date:: Fri Dec 6 07:04:56 2024 UTC

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

diff | patch | tree

Commit:: c7c064a8bf3e2b6aaaa8c6dc5e00d0553fc20728
From:: Lukas Henkel <lh@entf.net>
Date:: Fri Dec 6 05:56:04 2024 UTC

Day 6

diff | patch | tree

Commit:: c5b150512827fae8980848c3f48a685db29d3db6
From:: Lukas Henkel <lh@entf.net>
Date:: Thu Dec 5 06:21:32 2024 UTC

Split parsing

diff | patch | tree

Commit:: 1fa917d31e78f7342ab690a3447ef3ac47c9fcd9
From:: Lukas Henkel <lh@entf.net>
Date:: Thu Dec 5 06:08:22 2024 UTC

Simplify

diff | patch | tree

Commit:: eba1e3d671fb248cdf9966ced55805a490815e97
From:: Lukas Henkel <lh@entf.net>
Date:: Thu Dec 5 05:47:32 2024 UTC

Day 5

diff | patch | tree

Commit:: 98f2d1afbb774d5c33ff03525cad19b27a8aae12
From:: Lukas Henkel <lh@entf.net>
Date:: Wed Dec 4 05:50:07 2024 UTC

Day 4

diff | patch | tree

Commit:: e5bbdca6d8fff8576b98fcbe5cb98a9167d20a59
From:: Lukas Henkel <lh@entf.net>
Date:: Tue Dec 3 21:17:22 2024 UTC

Fix tests

diff | patch | tree

Commit:: 35dfaacf7838e916e7bebf9a02c17488493785b6
From:: Lukas Henkel <lh@entf.net>
Date:: Tue Dec 3 21:04:02 2024 UTC

Use simple parser generator to generate a parser This is quite a lot faster than using regex

diff | patch | tree

Commit:: c8859bce66424fc093ae4f999552d80c4bfc0989
From:: Lukas Henkel <lh@entf.net>
Date:: Tue Dec 3 05:30:20 2024 UTC

Import for asdf

diff | patch | tree

Commit:: 2b131a0c9cea5786a70d136aa843d2877776ef0e
From:: Lukas Henkel <lh@entf.net>
Date:: Tue Dec 3 05:27:59 2024 UTC

Cleanup

diff | patch | tree

Commit:: 1fa9aa89ff2daf4cc4a43f917512963bf9a4ab6b
From:: Lukas Henkel <lh@entf.net>
Date:: Tue Dec 3 05:15:56 2024 UTC

Add test

diff | patch | tree

Commit:: f4702ab909eae61b66c4164fb82c26bdb4f78337
From:: Lukas Henkel <lh@entf.net>
Date:: Tue Dec 3 05:13:33 2024 UTC

Day 3

diff | patch | tree

Commit:: 5ebe82fbf80d12d57735a7ddd314db7ecc3e132f
From:: Lukas Henkel <lh@entf.net>
Date:: Mon Dec 2 12:00:39 2024 UTC

Optimize

diff | patch | tree

Commit:: be08f67cded6e0367aeb15c08edd637f31e98965
From:: Lukas Henkel <lh@entf.net>
Date:: Mon Dec 2 05:37:12 2024 UTC

Day 2

diff | patch | tree

Commit:: 7a47c795fe3202aaf521b547c482e9d98ff837aa
From:: Lukas Henkel <lh@entf.net>
Date:: Sun Dec 1 11:50:28 2024 UTC

Parse input in same loop

diff | patch | tree

More ↓