git bisect, have to use --first-parent for that
https://github.com/def-/adventofcode-2023 
https://github.com/def-/adventofcode-2023 
def sum_calibration_values(calibration_document):
total_sum = 0
for line in calibration_document:
digits = [char for char in line if char.isdigit()]
if digits:
first_digit = digits[0]
last_digit = digits[-1]
two_digit_number = int(first_digit + last_digit)
total_sum += two_digit_number
return total_sum
# Example usage:
calibration_document = [
"1abc2",
"pqr3stu8vwx",
"a1b2c3d4e5f",
"treb7uchet"
]
result = sum_calibration_values(calibration_document)
print("Total sum of calibration values:", result)
let result = input.lines().fold(0u32, |acc, line| {
let indices: BTreeMap<_, _> = numbers
.keys()
.flat_map(|x| line.match_indices(*x))
.collect();
let first = numbers.get(indices.first_key_value().unwrap().1).unwrap();
let last = numbers.get(indices.last_key_value().unwrap().1).unwrap();
acc + first * 10 + last
}); let mut result = 0;
let mut indices = BTreeMap::new();
for line in input.lines() {
for x in numbers.keys() {
indices.extend(line.match_indices(x));
}
let first = numbers.get(indices.first_key_value().unwrap().1).unwrap();
let last = numbers.get(indices.last_key_value().unwrap().1).unwrap();
result += first * 10 + last;
indices.clear();
} 
let result = input.lines().fold(0u32, |acc, line| {
let indices: BTreeMap<_, _> = numbers
.keys()
.flat_map(|x| line.match_indices(*x))
.collect();
let first = numbers.get(indices.first_key_value().unwrap().1).unwrap();
let last = numbers.get(indices.last_key_value().unwrap().1).unwrap();
acc + first * 10 + last
}); let result: u32 = input.lines().par_bridge().map(|line| {
let indices: BTreeMap<_, _> = numbers
.keys()
.flat_map(|x| line.match_indices(*x))
.collect();
let first = numbers.get(indices.first_key_value().unwrap().1).unwrap();
let last = numbers.get(indices.last_key_value().unwrap().1).unwrap();
first * 10 + last
}).sum(); let result: u32 = input.lines().par_bridge().map(|line| {
let indices: BTreeMap<_, _> = numbers
.keys()
.flat_map(|x| line.match_indices(*x))
.collect();
let first = numbers.get(indices.first_key_value().unwrap().1).unwrap();
let last = numbers.get(indices.last_key_value().unwrap().1).unwrap();
first * 10 + last
}).sum(); let result: i32 = input
.par_lines()
.map(|line| {
let matches = numbers.keys().map(|x| line.match_indices(x));
let m = matches.flatten().peekable();
let (min, max) = match m.minmax_by_key(|x| x.0) {
MinMaxResult::NoElements => todo!(),
MinMaxResult::OneElement(min) => (min, min),
MinMaxResult::MinMax(min, max) => (min, max),
};
let first = numbers.get(min.1).unwrap();
let last = numbers.get(max.1).unwrap();
first * 10 + last
})
.sum();
i wonder if that makes any difference at all
@Jupstar ✪
1
UUID=8E37-E91C /boot vfat defaults,noatime 0 2
UUID=6739c2cc-4a15-4a30-b223-bafcdff6688f / ext4 defaults,noatime 0 1
# sda1 is the 2tb ssd partition for linux
UUID=c598fbd0-b87c-4e69-9fb6-8b2fd0624f24 /data1 ext4 defaults,noatime 0 2
UUID=f0146921-8313-4099-bb81-7c87675cbbfe /data2 ext4 defaults,noatime 0 2
UUID=d2359c6c-99c0-4f4f-9225-5605bed37399 none swap sw 0 0
/dev/cdrom /mnt/cdrom auto noauto,user 0 0
tmpfs /tmp tmpfs rw,nosuid,noatime,nodev,size=16G,mode=1777 0 0
tmpfs /var/tmp/portage tmpfs size=14G,uid=portage,gid=portage,mode=775,nosuid,noatime,nodev 0 0 
get1() function doesn't actually check for buffer overflow: it checks for bufsz > 0 but bufsz doesn't get updated. I'd change the while-loop line to while ((c = getc(f)) != EOF && c != '\n' && bufsz-- > 1)get1() function doesn't actually check for buffer overflow: it checks for bufsz > 0 but bufsz doesn't get updated. I'd change the while-loop line to while ((c = getc(f)) != EOF && c != '\n' && bufsz-- > 1) 
anyways good luck 
