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 15, 2026 04:21Victor MerckléVictor MerckléScore: 6,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 04:226,90167,147,34056,237,0001,043,0002,117,632stderr
2Sep 15, 2026 04:226,90567,058,91656,278,0001,034,0002,117,632stderr
3Sep 15, 2026 04:226,90568,336,60256,266,0001,046,0002,117,632stderr
4Sep 15, 2026 04:226,90767,151,85556,293,0001,038,0002,117,632stderr
5Sep 15, 2026 04:226,91967,321,11656,355,0001,078,0002,117,632stderr
6Sep 15, 2026 04:226,94267,392,65656,593,0001,032,0002,117,632stderr
7Sep 15, 2026 04:226,95567,509,33856,703,0001,029,0002,117,632stderr
8Sep 15, 2026 04:226,97667,700,13456,867,0001,037,0002,117,632stderr
9Sep 15, 2026 04:227,08068,717,86357,744,0001,028,0002,117,632stderr