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 listMar 21, 2026 09:06olliecrowolliecrowScore: 8,085Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 09:047,88190,221,14363,403,0002,012,0002,281,472
2Mar 21, 2026 09:067,95989,454,33363,056,0003,002,0002,400,256
3Mar 21, 2026 09:048,07996,499,96165,058,0002,001,0002,277,376
4Mar 21, 2026 09:048,08592,732,82065,104,0002,003,0002,285,568
5Mar 21, 2026 09:068,494121,515,87666,530,0003,971,0002,367,488
6Mar 21, 2026 09:068,56495,555,16865,077,0006,007,0002,519,040