project euler problem 10

main.rs

fn is_prime(val: u64) -> bool {
    let end = |current_val: u64| -> bool { current_val * current_val > val };

    let mut i = 2;
    loop {
        if end(i) {
            return true;
        }
        if (val % i) == 0 {
            return false;
        }

        i += 1;
    }
}
fn main() {
    const UPPER: u64 = 2 * 1000000;
    let sum: u64 = (2..=UPPER).filter(|i| is_prime(*i as u64)).sum();
    println!("{:?}", sum);
}