You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
So far, it seems that puzzles always yield numeric results, and part 2 alwals needs a slightly different way to parse the input data, so a standard form for the solution functions seems possible:
I'm thinking I'll steal from the unix philosophy here and lean into each day being its own binary. This is what I did for #3 and it means I can get some potential benefits:
Each binary can be as flexible as necessary for that day's given puzzle.
The runner can work with the simple assumption that the day's binary writes the solutions to separate lines on stdout, one line per part. If desired, this assumption can also lend itself to the runner submitting the result automatically.
Any informational logs can be written to stderr ad nauseam.
The runner can feed puzzle input via stdin, meaning puzzle input can be lazily fetched and cached by the runner the first time a puzzle is executed.
The text was updated successfully, but these errors were encountered: