Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Code Reviews

Welcome to Software Development on Codidact!

Will you help us build our independent community of developers helping developers? We're small and trying to grow. We welcome questions about all aspects of software development, from design to code to QA and more. Got questions? Got answers? Got code you'd like someone to review? Please join us.

Comments on Parsing numbers from a text file

Post

Parsing numbers from a text file

+3
−0

This is my solution to the first task of the Advent of Code 2023.

The task description is:

On each line, the calibration value can be found by combining the first digit and the last digit (in that order) to form a single two-digit number.

For example:

1abc2
pqr3stu8vwx
a1b2c3d4e5f
treb7uchet

In this example, the calibration values of these four lines are 12, 38, 15, and 77. Adding these together produces 142.

Consider your entire calibration document. What is the sum of all of the calibration values?

Here is my solution, which provides the correct sum (at least I passed the task):

use std::fs::read_to_string;
use regex::Regex;

fn main() {
    let re = Regex::new(r"^[\D]*(\d)(|.*(\d))\D*$").unwrap();
    let mut sum: u32 = 0;

    for line in read_to_string("calibration_data.txt").unwrap().lines() {
        println!("{line}");
        let Some(caps) = re.captures(line) else {
            panic!("no match! in line {line}");
        };
        let first: &str = &caps.get(1).map_or("0", |m| m.as_str());
        let second: &str = &caps.get(3).map_or(first, |m| m.as_str());
        let mut compound: String = String::new();
        compound.push_str(first);
        compound.push_str(second);
        println!("{first} + {second} = {compound}");
        let compound: u32 = compound.parse().unwrap();
        sum += compound;
    }

    println!("***********************");
    println!("Calibration sum: {sum}");
    println!("***********************");
}

Is there any way I could have done this better, especially regarding the extraction of the numbers from the text lines?

History
Why does this post require attention from curators or moderators?
You might want to add some details to your flag.
Why should this post be closed?

1 comment thread

Real problem size (3 comments)
Real problem size
matthewsnyder‭ wrote 5 months ago

Usually in AoC the example is of trivial size, but then the real problem input is much bigger. For this, you must have posted the example only. Can you add some information about how big you expect the real problem to be?

GeraldS‭ wrote 5 months ago

The actual input file has 1000 lines, but they are structured exactly as in the example. I can link to my original input file if needed, but I don't think it makes a difference if 100 or only a couple of lines are used.

matthewsnyder‭ wrote 5 months ago · edited 5 months ago

Ah, so just 1k lines, ~15 chars each? I guess that's so small it really doesn't matter how you do it. I thought they would have tried to trip up the regex solutions :)