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 24, 2026 17:31Victor MerckléVictor MerckléScore: 4,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 17:324,01841,795,69232,166,0001,184,0002,117,632stderr
2Aug 24, 2026 17:324,07942,250,96332,766,0001,096,0002,117,632stderr
3Aug 24, 2026 17:324,08242,231,48432,754,0001,129,0002,117,632stderr
4Aug 24, 2026 17:324,10142,545,74432,850,0001,196,0002,117,632stderr
5Aug 24, 2026 17:324,11042,549,23833,005,0001,113,0002,117,632stderr
6Aug 24, 2026 17:324,12242,615,21433,101,0001,117,0002,117,632stderr
7Aug 24, 2026 17:324,15042,848,74833,292,0001,157,0002,117,632stderr
8Aug 24, 2026 17:324,17843,153,34733,455,0001,223,0002,117,632stderr
9Aug 24, 2026 17:324,18143,077,48333,635,0001,074,0002,117,632stderr