Added code samples

3 files changed, 33 insertions, 0 deletions

diff --git a/samples/aoc/2022/01/input b/samples/aoc/2022/01/input
new file mode 100644
index 0000000..2094f91
--- /dev/null
+++ b/samples/aoc/2022/01/input
@@ -0,0 +1,14 @@
+1000
+2000
+3000
+
+4000
+
+5000
+6000
+
+7000
+8000
+9000
+
+10000
diff --git a/samples/aoc/2022/01/solve.bruijn b/samples/aoc/2022/01/solve.bruijn
new file mode 100644
index 0000000..7764db8
--- /dev/null
+++ b/samples/aoc/2022/01/solve.bruijn
@@ -0,0 +1,7 @@
+:import std/Math .
+:import std/String .
+
+main [lmax sums]
+	numbers number! <$> (lines 0)
+	parts split-at =?‣ numbers
+	sums sum <$> parts
diff --git a/samples/readme.md b/samples/readme.md
new file mode 100644
index 0000000..7ab3472
--- /dev/null
+++ b/samples/readme.md
@@ -0,0 +1,12 @@
+# Samples
+
+## AOC
+
+These samples solve some of the [Advent of
+Code](https://adventofcode.com) problems.
+
+    cat input | bruijn solve.bruijn
+
+**Be aware** that lambda calculus is generally incredibly inefficient.
+For example, the obvious solution for the very simple problem 2022/01
+takes around 1 minute and 4GB of memory using the full input.