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 5, 2026 13:26wnwnScore: 3,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 13:263,57538,195,83628,669,0001,008,0002,113,536
2Sep 5, 2026 13:263,57938,127,49728,673,0001,040,0002,113,536
3Sep 5, 2026 13:263,58038,202,14428,676,0001,040,0002,113,536
4Sep 5, 2026 13:263,58538,253,49828,725,0001,034,0002,113,536
5Sep 5, 2026 13:263,58738,190,69228,705,0001,071,0002,113,536
6Sep 5, 2026 13:263,80240,714,79930,556,0001,006,0002,113,536
7Sep 5, 2026 13:263,80340,018,05430,565,0001,003,0002,113,536
8Sep 5, 2026 13:263,80440,039,53330,543,0001,037,0002,113,536
9Sep 5, 2026 13:263,80540,675,04430,550,0001,032,0002,113,536