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 10:26Kevin HeaveyKevin HeaveyScore: 3,671Success
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 10:293,52337,520,70128,054,0001,190,0002,113,536
2Sep 6, 2026 10:293,53137,640,39928,098,0001,212,0002,113,536
3Sep 6, 2026 10:293,57137,908,12728,464,0001,179,0002,113,536
4Sep 6, 2026 10:293,58438,081,41428,734,0001,019,0002,113,536
5Sep 6, 2026 10:293,67138,772,21829,291,0001,180,0002,113,536
6Sep 6, 2026 10:293,68638,908,51829,578,0001,018,0002,113,536
7Sep 6, 2026 10:293,71539,157,54629,800,0001,041,0002,113,536
8Sep 6, 2026 10:293,71739,183,60129,658,0001,199,0002,113,536
9Sep 6, 2026 10:293,77239,613,43930,119,0001,196,0002,113,536