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 listMar 8, 2026 16:48caandocaandoScore: 5,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 16:485,79175,814,35246,063,0002,002,0002,514,944
2Mar 8, 2026 16:485,80071,750,86846,132,0002,005,0002,285,568
3Mar 8, 2026 16:485,81273,388,17947,236,0001,005,0002,285,568
4Mar 8, 2026 16:485,83071,170,64646,370,0002,016,0002,506,752
5Mar 8, 2026 16:485,86276,808,11247,645,0001,013,0002,523,136
6Mar 8, 2026 16:485,90472,116,14048,001,0001,000,0002,285,568