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 14:28parastromparastromScore: 3,852Success
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 14:293,78640,341,35130,382,0001,049,0002,113,536
2Sep 30, 2026 14:293,82840,708,21830,652,0001,126,0002,113,536
3Sep 30, 2026 14:293,83440,558,10130,678,0001,146,0002,113,536
4Sep 30, 2026 14:293,84240,740,19130,751,0001,140,0002,113,536
5Sep 30, 2026 14:293,85240,939,06530,842,0001,136,0002,113,536
6Sep 30, 2026 14:293,86741,106,55131,037,0001,066,0002,113,536
7Sep 30, 2026 14:293,86841,754,77530,981,0001,125,0002,113,536
8Sep 30, 2026 14:293,88741,182,27831,122,0001,143,0002,113,536
9Sep 30, 2026 14:293,96441,832,10531,825,0001,080,0002,113,536