Find the sum of all the primes below two million.

Summation of Primes.cpp

#include <bits/stdc++.h>
#include <cassert>
using namespace std;

int main() {
    int n = 2e6;
    long long sum = 2;
    for (int i = 3; i < n; i += 2) {
        bool prime = true;
        for (int j = 2; j * j <= i; j++) {
            if (i % j == 0) {
                prime = false;
                break;
            }
        }
        if (prime) {
            sum += i;
        }
    }
    cout << sum << endl;
}