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 24, 2026 07:11wnwnScore: 3,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 07:113,41939,382,05427,359,0001,024,0002,113,536
2Sep 24, 2026 07:113,43437,912,12127,474,0001,034,0002,113,536
3Sep 24, 2026 07:113,45338,108,44227,628,0001,040,0002,113,536
4Sep 24, 2026 07:113,48138,494,05727,853,0001,044,0002,113,536
5Sep 24, 2026 07:113,48638,417,85927,912,0001,028,0002,113,536
6Sep 24, 2026 07:113,49638,431,86828,019,0001,001,0002,113,536
7Sep 24, 2026 07:113,50438,533,07328,083,0001,004,0002,113,536
8Sep 24, 2026 07:113,51438,677,65728,145,0001,026,0002,113,536
9Sep 24, 2026 07:113,52738,726,64528,246,0001,036,0002,113,536