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 28, 2026 19:32Victor MerckléVictor MerckléScore: 4,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:324,84049,242,89339,157,0001,022,0002,117,632stderr
2Aug 28, 2026 19:324,85149,300,53339,249,0001,020,0002,117,632stderr
3Aug 28, 2026 19:324,86649,423,92739,367,0001,021,0002,117,632stderr
4Aug 28, 2026 19:324,87549,577,34539,444,0001,023,0002,117,632stderr
5Aug 28, 2026 19:324,89249,630,15939,586,0001,021,0002,117,632stderr
6Aug 28, 2026 19:324,89849,671,07139,636,0001,022,0002,117,632stderr
7Aug 28, 2026 19:324,91849,011,13939,805,0001,022,0002,117,632stderr
8Aug 28, 2026 19:324,95750,235,58140,121,0001,024,0002,117,632stderr
9Aug 28, 2026 19:324,95750,230,73140,127,0001,021,0002,117,632stderr