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 21, 2026 12:00Victor MerckléVictor MerckléScore: 5,161Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 12:015,15253,051,57741,636,0001,127,0002,113,536
2May 21, 2026 12:015,15551,364,00441,687,0001,106,0002,113,536
3May 21, 2026 12:015,15652,379,72641,677,0001,119,0002,113,536
4May 21, 2026 12:015,15752,869,28141,686,0001,119,0002,113,536
5May 21, 2026 12:015,16150,874,99541,671,0001,167,0002,113,536
6May 21, 2026 12:015,16252,131,91841,823,0001,022,0002,113,536
7May 21, 2026 12:015,17252,943,13141,818,0001,117,0002,113,536
8May 21, 2026 12:015,18353,738,08641,965,0001,054,0002,113,536
9May 21, 2026 12:015,26453,766,98542,579,0001,119,0002,113,536