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:34Victor MerckléVictor MerckléScore: 6,292Success
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:356,19660,536,67042,197,0009,231,0002,113,536
2Aug 27, 2026 13:356,22359,887,92941,504,00010,149,0002,113,536
3Aug 27, 2026 13:356,23462,146,80841,480,00010,263,0002,113,536
4Aug 27, 2026 13:356,27760,640,99841,668,00010,435,0002,113,536
5Aug 27, 2026 13:356,29261,418,27541,740,00010,487,0002,113,536
6Aug 27, 2026 13:356,33160,723,88042,265,00010,285,0002,113,536
7Aug 27, 2026 13:356,34560,840,52942,423,00010,241,0002,113,536
8Aug 27, 2026 13:356,49662,153,47443,780,00010,142,0002,113,536
9Aug 27, 2026 13:356,51363,163,59443,770,00010,289,0002,113,536