Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMay 13, 2026 12:19Victor MerckléVictor MerckléScore: 28,143Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 12:1928,127243,030,686232,416,0001,039,0002,113,536
2May 13, 2026 12:1928,136241,687,006232,529,0001,002,0002,113,536
3May 13, 2026 12:1928,143240,863,890232,581,0001,013,0002,113,536
4May 13, 2026 12:1928,143240,933,945232,574,0001,019,0002,113,536
5May 13, 2026 12:1928,143243,892,218232,572,0001,020,0002,113,536
6May 13, 2026 12:1928,144240,881,652232,577,0001,022,0002,113,536
7May 13, 2026 12:1928,155243,483,877232,693,0001,001,0002,113,536
8May 13, 2026 12:1928,463243,672,946235,236,0001,007,0002,113,536
9May 13, 2026 12:1928,465245,634,916235,249,0001,014,0002,113,536