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 6, 2026 03:14CheckHarryCheckHarryScore: 7,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 03:157,00068,019,29657,099,0001,009,0002,113,536
2Sep 6, 2026 03:157,03668,358,22957,387,0001,014,0002,113,536
3Sep 6, 2026 03:157,03768,323,03557,365,0001,049,0002,113,536
4Sep 6, 2026 03:157,03968,235,18157,419,0001,005,0002,113,536
5Sep 6, 2026 03:157,04368,306,35457,266,0001,193,0002,113,536
6Sep 6, 2026 03:157,04568,259,81657,470,0001,008,0002,113,536
7Sep 6, 2026 03:157,04668,371,14957,465,0001,024,0002,113,536
8Sep 6, 2026 03:157,05168,406,05657,522,0001,006,0002,113,536
9Sep 6, 2026 03:157,06268,514,80457,617,0001,005,0002,113,536