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 listSep 7, 2026 17:51Victor MerckléVictor MerckléScore: 4,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 17:524,53746,226,63133,051,0004,612,00024,576stderr
2Sep 7, 2026 17:524,75648,862,62034,600,0004,879,00024,576stderr
3Sep 7, 2026 17:524,83648,670,76935,430,0004,713,00024,576stderr
4Sep 7, 2026 17:524,89449,137,84735,555,0005,066,00024,576stderr
5Sep 7, 2026 17:524,94150,244,71034,355,0006,656,00024,576stderr
6Sep 7, 2026 17:525,00352,253,75036,625,0004,908,00024,576stderr
7Sep 7, 2026 17:525,04150,417,69535,925,0005,922,00024,576stderr
8Sep 7, 2026 17:525,14851,911,09136,477,0006,254,00024,576stderr
9Sep 7, 2026 17:525,19451,672,74835,836,0007,278,00024,576stderr