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 29, 2026 15:53Karthik ReddyKarthik ReddyScore: 4,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 15:534,02643,721,83532,317,0001,107,0002,113,536
2Sep 29, 2026 15:534,03043,778,97332,310,0001,139,0002,113,536
3Sep 29, 2026 15:534,03243,856,18932,358,0001,111,0002,113,536
4Sep 29, 2026 15:534,07745,677,94132,680,0001,164,0002,113,536
5Sep 29, 2026 15:534,12344,554,50833,075,0001,150,0002,113,536
6Sep 29, 2026 15:534,12544,568,81633,087,0001,151,0002,113,536
7Sep 29, 2026 15:534,13744,708,48833,191,0001,148,0002,113,536
8Sep 29, 2026 15:534,16144,896,25433,381,0001,160,0002,113,536
9Sep 29, 2026 15:534,18545,068,10933,613,0001,124,0002,113,536