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 listAug 30, 2026 21:06Josu San MartinJosu San MartinScore: 4,490Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 21:074,47745,596,58536,118,0001,044,0002,113,536
2Aug 30, 2026 21:074,48145,659,15336,152,0001,046,0002,113,536
3Aug 30, 2026 21:074,48445,719,57936,181,0001,043,0002,113,536
4Aug 30, 2026 21:074,48645,712,97436,206,0001,032,0002,113,536
5Aug 30, 2026 21:074,49045,786,61336,228,0001,041,0002,113,536
6Aug 30, 2026 21:074,49145,774,89636,245,0001,037,0002,113,536
7Aug 30, 2026 21:074,50045,803,78136,327,0001,029,0002,113,536
8Aug 30, 2026 21:074,51745,946,30936,452,0001,042,0002,113,536
9Aug 30, 2026 21:074,55446,254,07736,777,0001,023,0002,113,536