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 listFeb 21, 2026 11:00Daniel MastalerzDaniel MastalerzScore: 6,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 11:006,00873,408,04945,880,0003,989,0002,514,944
2Feb 21, 2026 11:006,02173,055,48545,977,0003,998,0002,265,088
3Feb 21, 2026 11:006,06769,786,30346,325,0004,028,0002,269,184
4Feb 21, 2026 11:006,12182,891,67346,817,0003,984,0002,306,048
5Feb 21, 2026 11:006,12378,979,78147,829,0002,989,0002,260,992
6Feb 21, 2026 11:006,13176,853,67546,899,0003,991,0002,301,952