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 14, 2026 15:34Kevin HeaveyKevin HeaveyScore: 3,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 15:363,53538,081,78428,163,0001,178,0002,113,536
2Sep 14, 2026 15:363,55038,228,62328,282,0001,191,0002,113,536
3Sep 14, 2026 15:363,55238,215,12528,323,0001,164,0002,113,536
4Sep 14, 2026 15:363,56038,314,29828,363,0001,188,0002,113,536
5Sep 14, 2026 15:363,56338,427,56928,378,0001,202,0002,117,632
6Sep 14, 2026 15:363,56438,923,68228,548,0001,039,0002,113,536
7Sep 14, 2026 15:363,73139,809,75029,760,0001,213,0002,113,536
8Sep 14, 2026 15:363,77940,820,68330,172,0001,199,0002,113,536
9Sep 14, 2026 15:363,85841,547,50230,988,0001,038,0002,113,536