Sum of Primes Below a Limit

A prime is an integer greater than 1 divisible only by 1 and itself. Add every prime strictly smaller than limit. The limit itself is excluded even when it is prime.

Implement prime_sum(limit).

Input

limit: The exclusive upper bound.

Output

Return the sum of the eligible primes, or 0 when none exist.

Restricciones

0 ≤ limit ≤ 2,000,000. Return the sum using a signed 64-bit integer.

Ejemplos

Entrada:
limit = 12

Salida esperada:
expected = 28

Entrada:
long long limit = 12;

Salida esperada:
long long expected = 28;

Entrada:
long limit = 12;

Salida esperada:
long expected = 28;

Entrada:
limit = 2

Salida esperada:
expected = 0

Entrada:
long long limit = 2;

Salida esperada:
long long expected = 0;

Entrada:
long limit = 2;

Salida esperada:
long expected = 0;

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

• #10 Summation of Primes