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 11, 2026 15:44Victor MerckléVictor MerckléScore: 3,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 15:463,91440,710,90631,388,0001,101,0002,117,632stderr
2Aug 11, 2026 15:463,94241,073,94131,584,0001,135,0002,117,632stderr
3Aug 11, 2026 15:463,95041,166,07831,739,0001,048,0002,117,632stderr
4Aug 11, 2026 15:463,97341,389,30231,953,0001,027,0002,117,632stderr
5Aug 11, 2026 15:463,97841,461,01231,972,0001,051,0002,117,632stderr
6Aug 11, 2026 15:463,99142,667,19732,103,0001,030,0002,117,632stderr
7Aug 11, 2026 15:464,06142,101,72132,654,0001,056,0002,117,632stderr
8Aug 11, 2026 15:464,08242,070,03232,786,0001,098,0002,117,632stderr
9Aug 11, 2026 15:464,13542,496,26433,265,0001,063,0002,117,632stderr