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 listOct 16, 2026 19:02KacpxerKacpxerScore: 5,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 19:025,73956,810,22746,622,0001,019,0002,117,632
2Oct 16, 2026 19:025,74556,730,70546,672,0001,013,0002,117,632
3Oct 16, 2026 19:025,75856,865,01546,785,0001,012,0002,117,632
4Oct 16, 2026 19:025,76256,978,67346,817,0001,015,0002,117,632
5Oct 16, 2026 19:025,81257,535,07047,233,0001,010,0002,117,632
6Oct 16, 2026 19:025,81257,273,21947,227,0001,013,0002,117,632
7Oct 16, 2026 19:025,87257,853,75547,726,0001,019,0002,117,632
8Oct 16, 2026 19:026,28161,343,81751,122,0001,015,0002,117,632
9Oct 16, 2026 19:026,41862,293,06052,263,0001,011,0002,117,632