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 2, 2026 04:00Josu San MartinJosu San MartinScore: 5,782Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 04:005,48973,147,82745,557,00002,293,760
2Feb 2, 2026 04:005,55070,917,28445,068,0001,001,0002,289,664
3Feb 2, 2026 04:005,63976,917,88944,816,0001,991,0002,519,040
4Feb 2, 2026 04:005,78274,086,84845,994,0001,999,0002,478,080
5Feb 2, 2026 04:005,81071,666,98847,215,0001,004,0002,375,680
6Feb 2, 2026 04:005,84673,376,43747,512,0001,010,0002,371,584