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 09:12Kevin HeaveyKevin HeaveyScore: 3,841Success
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 09:133,70540,730,05329,603,0001,153,0002,113,536
2Sep 6, 2026 09:133,74041,057,68629,897,0001,148,0002,113,536
3Sep 6, 2026 09:133,75741,214,16830,143,0001,045,0002,113,536
4Sep 6, 2026 09:133,82541,815,15230,708,0001,042,0002,113,536
5Sep 6, 2026 09:133,84141,805,05430,705,0001,178,0002,113,536
6Sep 6, 2026 09:133,84342,886,41630,673,0001,228,0002,113,536
7Sep 6, 2026 09:133,87442,168,25730,963,0001,199,0002,113,536
8Sep 6, 2026 09:133,87542,999,65630,990,0001,175,0002,113,536
9Sep 6, 2026 09:133,88342,284,82631,064,0001,165,0002,113,536