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 14:44Victor MerckléVictor MerckléScore: 4,569Success
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 14:454,55646,062,12636,758,0001,065,0002,113,536
2May 21, 2026 14:454,55845,640,00136,782,0001,057,0002,113,536
3May 21, 2026 14:454,56245,738,45836,797,0001,071,0002,113,536
4May 21, 2026 14:454,56747,840,53436,826,0001,087,0002,113,536
5May 21, 2026 14:454,56945,747,11836,895,0001,029,0002,113,536
6May 21, 2026 14:454,57145,933,20836,917,0001,026,0002,113,536
7May 21, 2026 14:454,58346,629,14036,955,0001,089,0002,113,536
8May 21, 2026 14:454,58447,732,89136,957,0001,092,0002,113,536
9May 21, 2026 14:454,59645,975,73237,102,0001,049,0002,113,536