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 11, 2026 07:25wnwnScore: 3,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:263,31436,200,49627,509,00002,113,536
2May 11, 2026 07:263,33235,508,12827,663,00002,113,536
3May 11, 2026 07:263,38735,902,88228,116,00002,113,536
4May 11, 2026 07:263,41836,835,45128,376,00002,113,536
5May 11, 2026 07:263,46138,046,34728,732,00002,113,536
6May 11, 2026 07:263,47736,663,74328,865,00002,113,536
7May 11, 2026 07:263,49936,845,06429,043,00002,113,536
8May 11, 2026 07:263,50536,799,00728,090,0001,009,0002,113,536
9May 11, 2026 07:263,51939,215,67829,215,00002,113,536