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 23:49Victor MerckléVictor MerckléScore: 7,574Success
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 23:497,56872,073,95962,822,00002,113,536
2May 13, 2026 23:497,57071,984,98862,835,00002,113,536
3May 13, 2026 23:497,57173,282,17462,842,00002,113,536
4May 13, 2026 23:497,57272,378,39562,851,00002,113,536
5May 13, 2026 23:497,57472,436,62762,866,00002,113,536
6May 13, 2026 23:497,61672,222,62163,218,00002,113,536
7May 13, 2026 23:497,63673,624,52363,379,00002,113,536
8May 13, 2026 23:497,67171,712,12263,674,00002,113,536
9May 13, 2026 23:497,72373,874,40364,104,00002,113,536