[2025] Day 6 draft solutions

Author: connorslade

README.md

@@ -10,6 +10,7 @@ Thank you to [Eric Wastl](http://was.tl) for running this incredible yearly even
 - [Day 03: Lobby](aoc_2025/src/day_03.rs)
 - [Day 04: Printing Department](aoc_2025/src/day_04.rs)
 - [Day 05: Cafeteria](aoc_2025/src/day_05.rs)
+- [Day 06: Trash Compactor](aoc_2025/src/day_06.rs)
 <!-- MARKER -->
 
 ## [2024](https://adventofcode.com/2024) [![aoc_2024](https://github.com/connorslade/advent-of-code/actions/workflows/aoc_2024.yml/badge.svg)](https://github.com/connorslade/advent-of-code/actions/workflows/aoc_2024.yml)

aoc_2025/src/day_06.rs

@@ -0,0 +1,97 @@
+use std::{convert::identity, mem};
+
+use aoc_lib::matrix::Grid;
+use common::{Answer, solution};
+use nd_vec::vector;
+
+solution!("Trash Compactor", 6);
+
+fn part_a(input: &str) -> Answer {
+    let (nums, ops) = input.trim().rsplit_once('\n').unwrap();
+
+    let mut problems = Vec::new();
+    for line in nums.lines() {
+        let nums = line
+            .split_whitespace()
+            .map(|x| x.parse::<u64>().unwrap())
+            .collect::<Vec<_>>();
+        if problems.is_empty() {
+            problems.resize(nums.len(), Vec::new());
+        }
+
+        for (i, num) in nums.iter().enumerate() {
+            problems[i].push(*num);
+        }
+    }
+
+    let ops = ops.split_whitespace().collect::<Vec<_>>();
+
+    let mut out = 0;
+    for (nums, op) in problems.iter().zip(ops) {
+        match op {
+            "*" => out += nums.iter().product::<u64>(),
+            "+" => out += nums.iter().sum::<u64>(),
+            _ => panic!(),
+        }
+    }
+
+    out.into()
+}
+
+fn part_b(input: &str) -> Answer {
+    let grid = Grid::parse(input, identity);
+    let size = grid.size();
+
+    let mut pos = vector!(size.x() - 1, 0);
+
+    let mut out = 0;
+    let mut nums = Vec::new();
+    'outer: loop {
+        let mut num = 0;
+        while pos.y() < size.y() {
+            let chr = grid.get(pos).unwrap();
+
+            if matches!(chr, '+' | '*') {
+                nums.push(mem::take(&mut num));
+                dbg!(&nums);
+                match chr {
+                    '+' => out += mem::take(&mut nums).iter().sum::<u64>(),
+                    '*' => out += mem::take(&mut nums).iter().product::<u64>(),
+                    _ => {}
+                }
+
+                if pos.x() == 0 {
+                    break 'outer;
+                }
+
+                pos = vector!(pos.x() - 2, 0);
+                continue 'outer;
+            }
+
+            if let Some(digit) = chr.to_digit(10) {
+                num = num * 10 + digit as u64;
+            }
+            pos += vector!(0, 1);
+        }
+        nums.push(mem::take(&mut num));
+
+        pos = vector!(pos.x() - 1, 0);
+    }
+
+    out.into()
+}
+
+#[cfg(test)]
+mod test {
+    const CASE: &str = "123 328  51 64 \n 45 64  387 23 \n  6 98  215 314\n*   +   *   +  ";
+
+    #[test]
+    fn part_a() {
+        assert_eq!(super::part_a(CASE), 4277556.into());
+    }
+
+    #[test]
+    fn part_b() {
+        assert_eq!(super::part_b(CASE), 3263827.into());
+    }
+}

aoc_2025/src/lib.rs

@@ -5,6 +5,7 @@ mod day_02;
 mod day_03;
 mod day_04;
 mod day_05;
+mod day_06;
 // [import_marker]
 
 pub const SOLUTIONS: &[Solution] = &[
@@ -13,5 +14,6 @@ pub const SOLUTIONS: &[Solution] = &[
     day_03::SOLUTION,
     day_04::SOLUTION,
     day_05::SOLUTION,
+    day_06::SOLUTION,
     // [list_marker]
 ];

src/commands/run.rs

@@ -29,7 +29,7 @@ pub fn run(cmd: &RunArgs) -> Result<()> {
         }
     };
 
-    let input = fs::read_to_string(&*path)?.trim().replace('\r', "");
+    let input = fs::read_to_string(&*path)?.replace('\r', "");
 
     let start = Instant::now();
     let out = match cmd.part {