Project Euler #6: Sum square difference

This article is part of a series where I'll be diving head first into the Project Euler puzzles. I want to document the challenge of solving such a puzzle and how I got to the answer. I want to prefix this by stating that I can't cheat for any of these challenges; with that I mean I can't look up any other implementations online. After the implementation, I will validate the answer by using this document or a similar sheet.

In this article I'll be solving: Project Euler #6.

This article features only an answer, because I’ve started writing from problem 14.

fn problem_6() -> u128 {
    let mut sum: u128 = 0;
    let mut n_sum: u128 = 0;
    for n in 1..100 {
        sum += (n as u128).pow(2);
        n_sum += n;
    }
    n_sum.pow(2) - sum
}

#[test]
fn test_problem_6() {
    assert_eq!(problem_6(), 24174150);
}

The full solution is available on GitHub.

63 62 61 60 59 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1