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 13, 2026 18:02Victor MerckléVictor MerckléScore: 3,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2026 18:053,45438,541,91527,540,0001,129,0002,117,632stderr
2Sep 13, 2026 18:053,46139,199,56327,614,0001,118,0002,117,632stderr
3Sep 13, 2026 18:053,46438,564,04527,630,0001,128,0002,117,632stderr
4Sep 13, 2026 18:053,46938,731,92827,786,0001,009,0002,117,632stderr
5Sep 13, 2026 18:053,47038,635,06827,687,0001,115,0002,117,632stderr
6Sep 13, 2026 18:053,47639,616,69827,711,0001,145,0002,117,632stderr
7Sep 13, 2026 18:053,47938,614,83127,731,0001,150,0002,117,632stderr
8Sep 13, 2026 18:053,54339,244,97728,284,0001,129,0002,117,632stderr
9Sep 13, 2026 18:053,58540,318,25428,609,0001,147,0002,117,632stderr