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 listSep 4, 2026 08:30Victor MerckléVictor MerckléScore: 3,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 08:333,64638,698,05729,128,0001,134,0002,117,632stderr
2Sep 4, 2026 08:333,65438,720,98929,270,0001,063,0002,117,632stderr
3Sep 4, 2026 08:333,65738,767,61529,230,0001,127,0002,117,632stderr
4Sep 4, 2026 08:333,66138,732,08429,262,0001,130,0002,117,632stderr
5Sep 4, 2026 08:333,66738,829,05729,377,0001,065,0002,117,632stderr
6Sep 4, 2026 08:333,68138,962,72029,518,0001,040,0002,117,632stderr
7Sep 4, 2026 08:333,69739,070,52229,535,0001,157,0002,117,632stderr
8Sep 4, 2026 08:333,69739,109,58029,549,0001,141,0002,117,632stderr
9Sep 4, 2026 08:333,70739,152,46829,621,0001,153,0002,117,632stderr