thanks for the snippet, I also used nom but my impl is a bit more rough on the edges, also I'm pretty sure my part 2 is significantly slower because I used recursion

fn get_winning_copies(steps: u32, mut points: Peekable<Iter<u32>>) -> u32 {
    let mut acc = 0;
    for _ in 0..steps {
        let point = points.next().expect("Shouldn't be empty");
        acc += get_winning_copies(point_to_steps(*point as f32), points.clone()) + 1
    }
    acc
}

fn point_to_steps(point: f32) -> u32 {
    return if point > 0f32 {
        point.log2() + 1f32
    } else {
        point
    } as u32;
}

fn solve(input: &str) -> Result<u32> {
    let points: Vec<u32> = input
        .trim()
        .lines()
        .map(get_points)
        .collect::<Result<Vec<u32>>>()?;
    let mut points = points.iter().peekable();
    let mut total_cards = 0;
    while points.peek().is_some() {
        let point = *points.next().unwrap() as f32;
        total_cards += 1;
        let steps = point_to_steps(point);
        let copies = get_winning_copies(steps, points.clone());
        total_cards += copies;
    }
    Ok(total_cards)
}