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 listAug 23, 2026 18:26Victor MerckléVictor MerckléScore: 3,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 18:273,83140,120,23630,687,0001,117,0002,117,632stderr
2Aug 23, 2026 18:273,83940,336,03930,732,0001,136,0002,117,632stderr
3Aug 23, 2026 18:273,84140,304,98830,768,0001,117,0002,117,632stderr
4Aug 23, 2026 18:273,85040,340,02830,796,0001,161,0002,117,632stderr
5Aug 23, 2026 18:273,85840,455,17630,951,0001,077,0002,117,632stderr
6Aug 23, 2026 18:273,86040,425,80530,976,0001,068,0002,117,632stderr
7Aug 23, 2026 18:273,86340,764,66530,936,0001,131,0002,117,632stderr
8Aug 23, 2026 18:273,88349,968,83831,103,0001,131,0002,117,632stderr
9Aug 23, 2026 18:273,91040,855,52431,388,0001,065,0002,117,632stderr