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 21, 2026 16:52Joshua MontrossJoshua MontrossScore: 9,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 16:529,00784,578,37173,654,0001,106,0002,113,536
2Aug 21, 2026 16:529,01684,740,06773,629,0001,205,0002,113,536
3Aug 21, 2026 16:529,01884,763,43873,642,0001,214,0002,113,536
4Aug 21, 2026 16:529,02184,705,76073,753,0001,126,0002,113,536
5Aug 21, 2026 16:529,03084,814,01273,750,0001,202,0002,113,536
6Aug 21, 2026 16:529,04384,872,51273,952,0001,110,0002,113,536
7Aug 21, 2026 16:529,05386,420,03974,021,0001,120,0002,113,536
8Aug 21, 2026 16:529,29886,934,12976,070,0001,105,0002,113,536
9Aug 21, 2026 16:529,40987,921,70776,912,0001,189,0002,113,536