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 listMay 15, 2026 05:46Victor MerckléVictor MerckléScore: 64,385Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 05:4664,311541,615,563532,630,0001,153,0002,117,632stderr
2May 15, 2026 05:4664,376543,819,220533,193,0001,134,0002,117,632stderr
3May 15, 2026 05:4664,379541,715,644533,192,0001,159,0002,117,632stderr
4May 15, 2026 05:4664,380542,278,077533,222,0001,135,0002,117,632stderr
5May 15, 2026 05:4664,385541,749,503533,344,0001,053,0002,117,632stderr
6May 15, 2026 05:4664,386542,270,755533,358,0001,047,0002,117,632stderr
7May 15, 2026 05:4664,387541,620,477533,224,0001,189,0002,117,632stderr
8May 15, 2026 05:4664,398541,963,268533,336,0001,171,0002,117,632stderr
9May 15, 2026 05:4664,403543,090,062533,473,0001,074,0002,117,632stderr