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 27, 2026 13:05Victor MerckléVictor MerckléScore: 3,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 13:063,82140,761,63929,377,0002,339,0002,113,536
2Aug 27, 2026 13:063,82639,925,01229,423,0002,335,0002,113,536
3Aug 27, 2026 13:063,83440,099,64129,490,0002,337,0002,113,536
4Aug 27, 2026 13:063,86540,456,28829,765,0002,321,0002,113,536
5Aug 27, 2026 13:063,87240,580,31229,889,0002,252,0002,113,536
6Aug 27, 2026 13:063,93840,956,10230,445,0002,241,0002,113,536
7Aug 27, 2026 13:064,00943,593,69230,919,0002,357,0002,113,536
8Aug 27, 2026 13:064,04141,862,59331,307,0002,236,0002,113,536
9Aug 27, 2026 13:064,07443,559,13531,609,0002,210,0002,113,536