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 11:52Kevin HeaveyKevin HeaveyScore: 3,815Success
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 11:533,73140,195,97029,785,0001,189,0002,113,536
2Sep 6, 2026 11:533,75240,382,95929,936,0001,208,0002,113,536
3Sep 6, 2026 11:533,77139,528,85330,088,0001,218,0002,113,536
4Sep 6, 2026 11:533,81340,871,73930,463,0001,192,0002,113,536
5Sep 6, 2026 11:533,81540,921,59630,455,0001,210,0002,113,536
6Sep 6, 2026 11:533,82040,884,63330,492,0001,221,0002,113,536
7Sep 6, 2026 11:533,82142,238,53330,665,0001,051,0002,113,536
8Sep 6, 2026 11:533,84441,081,93230,689,0001,221,0002,113,536
9Sep 6, 2026 11:533,84440,546,14030,705,0001,201,0002,113,536