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 30, 2026 21:18Karthik ReddyKarthik ReddyScore: 3,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2026 21:183,75039,973,79330,011,0001,116,0002,117,632
2Sep 30, 2026 21:183,76840,200,47530,157,0001,121,0002,117,632
3Sep 30, 2026 21:183,77140,231,27230,183,0001,123,0002,117,632
4Sep 30, 2026 21:183,81640,506,51330,535,0001,138,0002,117,632
5Sep 30, 2026 21:183,82940,941,33330,647,0001,141,0002,117,632
6Sep 30, 2026 21:183,84240,767,27230,778,0001,113,0002,117,632
7Sep 30, 2026 21:183,87141,039,22431,001,0001,130,0002,117,632
8Sep 30, 2026 21:183,88641,740,14531,161,0001,099,0002,117,632
9Sep 30, 2026 21:183,88941,358,74531,152,0001,132,0002,117,632