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 25, 2026 04:00Karthik ReddyKarthik ReddyScore: 5,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 04:005,45755,507,92644,118,0001,177,0002,113,536
2Sep 25, 2026 04:005,46055,597,07244,177,0001,148,0002,113,536
3Sep 25, 2026 04:005,50556,045,48344,554,0001,140,0002,113,536
4Sep 25, 2026 04:005,50956,006,25544,588,0001,139,0002,113,536
5Sep 25, 2026 04:005,51456,083,62344,620,0001,151,0002,113,536
6Sep 25, 2026 04:005,52856,079,63144,745,0001,142,0002,113,536
7Sep 25, 2026 04:005,53356,150,82044,862,0001,070,0002,113,536
8Sep 25, 2026 04:005,57856,462,52545,158,0001,144,0002,113,536
9Sep 25, 2026 04:005,60758,000,70245,509,0001,037,0002,113,536