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 11:11Kevin HeaveyKevin HeaveyScore: 3,614Success
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 11:123,53937,814,90328,310,0001,070,0002,113,536
2Sep 6, 2026 11:123,55737,917,53528,438,0001,092,0002,113,536
3Sep 6, 2026 11:123,55938,016,07628,449,0001,095,0002,113,536
4Sep 6, 2026 11:123,60538,496,25028,668,0001,256,0002,113,536
5Sep 6, 2026 11:123,61438,599,07128,945,0001,052,0002,113,536
6Sep 6, 2026 11:123,67339,122,43129,454,0001,035,0002,113,536
7Sep 6, 2026 11:123,73339,514,62729,952,0001,035,0002,113,536
8Sep 6, 2026 11:123,84540,568,34530,665,0001,249,0002,113,536
9Sep 6, 2026 11:123,88640,869,20131,202,0001,053,0002,113,536