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 8, 2026 20:32Victor MerckléVictor MerckléScore: 3,571Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 20:353,48037,009,24927,744,0001,145,0002,117,632stderr
2Sep 8, 2026 20:353,53146,741,01428,304,0001,011,0002,117,632stderr
3Sep 8, 2026 20:353,53244,048,79728,307,0001,010,0002,117,632stderr
4Sep 8, 2026 20:353,53337,641,85428,181,0001,143,0002,117,632stderr
5Sep 8, 2026 20:353,57137,711,69528,506,0001,140,0002,117,632stderr
6Sep 8, 2026 20:353,58138,034,29528,597,0001,127,0002,117,632stderr
7Sep 8, 2026 20:353,60245,837,84528,867,0001,030,0002,117,632stderr
8Sep 8, 2026 20:353,63947,934,20429,191,0001,019,0002,117,632stderr
9Sep 8, 2026 20:353,66547,257,60829,260,0001,162,0002,117,632stderr