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 6, 2026 07:53CheckHarryCheckHarryScore: 4,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 07:544,77349,558,19238,605,0001,011,0002,113,536
2Sep 6, 2026 07:544,77549,435,73538,630,0001,008,0002,113,536
3Sep 6, 2026 07:544,77549,543,52438,629,0001,008,0002,113,536
4Sep 6, 2026 07:544,77949,931,18138,652,0001,016,0002,113,536
5Sep 6, 2026 07:544,77949,565,87038,639,0001,033,0002,113,536
6Sep 6, 2026 07:544,84950,106,10239,231,0001,017,0002,113,536
7Sep 6, 2026 07:544,88750,445,76339,563,0001,007,0002,113,536
8Sep 6, 2026 07:544,90750,586,86139,727,0001,009,0002,113,536
9Sep 6, 2026 07:544,92250,749,73439,844,0001,011,0002,113,536