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 20, 2026 15:26Victor MerckléVictor MerckléScore: 5,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 15:295,56055,517,00545,099,0001,056,0002,113,536
2May 20, 2026 15:295,56854,842,34745,157,0001,064,0002,113,536
3May 20, 2026 15:295,57954,450,99345,228,0001,078,0002,113,536
4May 20, 2026 15:295,58155,436,10345,255,0001,068,0002,113,536
5May 20, 2026 15:295,58456,344,05845,316,0001,036,0002,113,536
6May 20, 2026 15:295,59656,478,39845,418,0001,035,0002,113,536
7May 20, 2026 15:295,60354,268,50845,500,0001,005,0002,113,536
8May 20, 2026 15:295,67555,881,46646,044,0001,060,0002,113,536
9May 20, 2026 15:295,67955,355,47746,074,0001,062,0002,113,536