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 23:17Juraj ZelmanJuraj ZelmanScore: 8,349Success
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 23:178,31393,559,10567,996,000999,0002,285,568
2Feb 21, 2026 23:178,33695,588,18768,185,0001,002,0002,371,584
3Feb 21, 2026 23:178,34997,361,36469,296,00002,293,760
4Feb 21, 2026 23:178,34990,826,21569,296,00002,285,568
5Feb 21, 2026 23:178,35295,754,02168,321,0001,004,0002,293,760
6Feb 21, 2026 23:178,35790,516,74168,355,0001,005,0002,293,760