Remove python, use alpine. Holy speed, batman.

01.py

@@ -1,17 +0,0 @@
-import itertools
-
-
-def first_duplicate(values):
-    seen = set()
-    for item in values:
-        if item in seen:
-            return item
-        seen.add(item)
-    return None
-
-
-with open('data/01.txt', 'r') as file:
-    frequencies = list(map(int, file.readlines()))
-
-    print(sum(frequencies))
-    print(first_duplicate(itertools.accumulate(itertools.cycle(frequencies))))

02.py

@@ -1,27 +0,0 @@
-import itertools
-import operator
-
-
-def count_dupes(box):
-    return [any(box.count(x) == i for x in box) for i in (2, 3)]
-
-
-with open('data/02.txt', 'r') as file:
-    boxes = list(map(str.strip, file.readlines()))
-
-    print(operator.mul(*map(sum, zip(*map(count_dupes, boxes)))))
-
-    for box1, box2 in itertools.combinations(boxes, 2):
-        common = ''
-        missed = 0
-        for i, j in zip(box1, box2):
-            if i == j:
-                common += i
-            else:
-                missed += 1
-                if missed > 1:
-                    break
-
-        if missed == 1:
-            print(common)
-            break

03.py

@@ -1,30 +0,0 @@
-import re
-from collections import defaultdict
-
-with open('data/03.txt', 'r') as file:
-    cells = defaultdict(lambda: 0)
-    claims = map(lambda l: map(int, re.findall(r'\d+', l)), file.readlines())
-    ids = set()
-    overlaps = 0
-
-    for (cid, x, y, width, height) in claims:
-        collision = False
-        for i in range(width):
-            for j in range(height):
-                previous = cells[(x + i, y + j)]
-                if previous == 0:
-                    cells[(x + i, y + j)] = cid
-                elif previous == -1:
-                    collision = True
-                else:
-                    collision = True
-                    overlaps += 1
-                    if previous in ids:
-                        ids.remove(previous)
-                    cells[(x + i, y + j)] = -1
-
-        if not collision:
-            ids.add(cid)
-
-    print(overlaps)
-    print(list(ids)[0])

04.py

@@ -1,21 +0,0 @@
-from collections import defaultdict, Counter
-
-sleeps = defaultdict(Counter)
-
-with open('data/04.txt', 'r') as file:
-    guard = sleep = 0
-
-    for log in sorted(line.strip() for line in file):
-        action = log[-5:]
-        if action == 'shift':
-            guard = log[26:-13]
-        elif action == 'sleep':
-            sleep = int(log[15:17])
-        else:
-            sleeps[guard].update(range(sleep, int(log[15:17])))
-
-most_sleep = max(sleeps.items(), key=lambda p: sum(p[1].values()))
-print(int(most_sleep[0]) * most_sleep[1].most_common(1)[0][0])
-
-sleepiest_minute = max([(guard, times.most_common(1)[0]) for (guard, times) in sleeps.items()], key=lambda p: p[1][1])
-print(int(sleepiest_minute[0]) * sleepiest_minute[1][0])

05.py

@@ -1,20 +0,0 @@
-from functools import partial, reduce
-
-with open('data/05.txt', 'r') as file:
-    polymer = map(ord, file.readline().strip())
-
-
-def react(ignored, head, n):
-    if n == ignored or n ^ ignored == 32:
-        return head
-    elif not head:
-        return [n]
-    elif head[-1] ^ n == 32:
-        return head[0:-1]
-    else:
-        return head + [n]
-
-
-reacted = reduce(partial(react, 0), polymer, [])
-print(len(reacted))
-print(min(len(reduce(partial(react, i), reacted, [])) for i in range(ord('A'), ord('Z'))))

README.md

@@ -1,7 +1,6 @@
 # Advent of Code 2018
 
-This repository contains my solution to 2018's [Advent of Code](https://adventofcode.com/2018) puzzles. The solutions
-are a mixture of Python 3 and Nim.
+This repository contains my solution to 2018's [Advent of Code](https://adventofcode.com/2018) puzzles in Nim.
 
 The easiest way to run these is using docker -- simply execute `run.sh <day>` to build a docker image and execute the
 specific day.

day08.nim

@@ -16,7 +16,7 @@ func readNode(input: var seq[string]): tuple[value: int, metasum: int] =
 
     for m in 0..meta_count-1:
         var v = input.pop.parseInt
-        if v > 0 and v - 1 < child_count:
+        if v > 0 and v <= child_count:
             value += child_values[v - 1]
         metasum += v
     

docker/Dockerfile

@@ -1,6 +1,4 @@
-FROM nimlang/nim
-
-RUN apt-get update && apt-get install -y pypy
+FROM nimlang/nim:alpine
 
 ADD entrypoint.sh /entrypoint.sh
 RUN chmod +x /entrypoint.sh

docker/entrypoint.sh

@@ -1,10 +1,8 @@
-#!/bin/bash
+#!/bin/sh
 
 cd /code
 
 if [ -f "day$1.nim" ]; then
     HOME=/tmp nim c --opt:speed -d:release day$1.nim >/dev/null 2>&1
     time ./day$1
-else
-    time pypy "$1.py"
 fi

run.sh

@@ -1,6 +1,6 @@
 #!/bin/bash
 
-IMAGE=csmith/aoc-2018-03
+IMAGE=csmith/aoc-2018-04
 
 docker image inspect $IMAGE >/dev/null 2>&1
 if [ $? -ne 0 ]