diff --git a/README.md b/README.md
index fba0870..7b462d6 100644
--- a/README.md
+++ b/README.md
@@ -30,11 +30,11 @@ My solutions may not be the most optimal solutions. I will try to improve them a
 
 ### Leetcode Statistics
 #### Daily challenges by month
-| Month    |   Daily Challenges |
-|----------|--------------------|
-| January  |                  0 |
-| December |                  0 |
-| November |                  0 |
+| Month     |   Daily Challenges |
+|-----------|--------------------|
+| December  |                  0 |
+| October   |                  0 |
+| September |                  0 |
 
 #### Total problems by language
 | Language   |   Number of Problems |
diff --git a/advent_of_code/2024/day_01.py b/advent_of_code/2024/day_01.py
new file mode 100644
index 0000000..4c793ea
--- /dev/null
+++ b/advent_of_code/2024/day_01.py
@@ -0,0 +1,71 @@
+from collections import Counter, defaultdict, deque
+
+import aoc_helper
+from aoc_helper import (
+    Grid,
+    PrioQueue,
+    SparseGrid,
+    decode_text,
+    extract_ints,
+    extract_iranges,
+    extract_ranges,
+    extract_uints,
+    frange,
+    irange,
+    iter,
+    list,
+    map,
+    multirange,
+    range,
+    search,
+    tail_call,
+)
+
+raw = aoc_helper.fetch(1, 2024)
+
+
+def parse_raw(raw: str):
+    return raw
+
+
+data = parse_raw(raw)
+
+
+# providing this default is somewhat of a hack - there isn't any other way to
+# force type inference to happen, AFAIK - but this won't work with standard
+# collections (list, set, dict, tuple)
+def part_one(data=data):
+    list_one = []
+    list_two = []
+    for line in data.splitlines():
+        list_one.append(int(line.split()[0]))
+        list_two.append(int(line.split()[1]))
+    list_one.sort()
+    list_two.sort()
+    t = 0
+    for i in range(len(list_one)):
+        t += abs(list_two[i]-list_one[i])
+    return t
+
+aoc_helper.lazy_test(day=1, year=2024, parse=parse_raw, solution=part_one)
+
+
+# providing this default is somewhat of a hack - there isn't any other way to
+# force type inference to happen, AFAIK - but this won't work with standard
+# collections (list, set, dict, tuple)
+def part_two(data=data):
+    list_one = []
+    list_two = []
+    for line in data.splitlines():
+        list_one.append(int(line.split()[0]))
+        list_two.append(int(line.split()[1]))
+    t = 0
+    for item in list_one:
+        c = list_two.count(item)
+        t += item * c
+    return t
+
+aoc_helper.lazy_test(day=1, year=2024, parse=parse_raw, solution=part_two)
+
+aoc_helper.lazy_submit(day=1, year=2024, solution=part_one, data=data)
+aoc_helper.lazy_submit(day=1, year=2024, solution=part_two, data=data)