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 listFeb 21, 2026 15:09Juraj ZelmanJuraj ZelmanScore: 8,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 15:098,56893,238,65470,112,0001,001,0002,285,568
2Feb 21, 2026 15:098,57597,559,97069,171,0002,004,0002,285,568
3Feb 21, 2026 15:098,61790,697,01470,515,0001,007,0002,371,584
4Feb 21, 2026 15:098,66196,699,17769,891,0001,996,0002,355,200
5Feb 21, 2026 15:098,66597,123,58669,925,0001,997,0002,293,760
6Feb 21, 2026 15:098,672102,002,58169,979,0001,999,0002,293,760