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 08:23Kevin HeaveyKevin HeaveyScore: 3,547Success
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 08:263,52137,495,00828,008,0001,217,0002,113,536
2Sep 6, 2026 08:263,53437,659,49128,303,0001,033,0002,113,536
3Sep 6, 2026 08:263,53937,631,42828,187,0001,189,0002,113,536
4Sep 6, 2026 08:263,54437,772,14728,325,0001,093,0002,113,536
5Sep 6, 2026 08:263,54737,799,32328,391,0001,050,0002,113,536
6Sep 6, 2026 08:263,54937,814,17228,425,0001,036,0002,113,536
7Sep 6, 2026 08:263,56437,877,12128,445,0001,138,0002,113,536
8Sep 6, 2026 08:263,58938,087,41828,568,0001,225,0002,113,536
9Sep 6, 2026 08:263,69639,035,18829,470,0001,213,0002,113,536