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 5, 2026 17:56CheckHarryCheckHarryScore: 4,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 17:584,27645,314,70234,480,0001,017,0002,113,536
2Sep 5, 2026 17:584,29445,536,14434,629,0001,016,0002,113,536
3Sep 5, 2026 17:584,30645,604,47234,727,0001,017,0002,113,536
4Sep 5, 2026 17:584,40346,428,77235,536,0001,016,0002,113,536
5Sep 5, 2026 17:584,40746,410,56635,565,0001,016,0002,113,536
6Sep 5, 2026 17:584,41346,504,35335,618,0001,018,0002,113,536
7Sep 5, 2026 17:584,43046,717,85635,586,0001,190,0002,113,536
8Sep 5, 2026 17:584,43346,676,82135,778,0001,017,0002,113,536
9Sep 5, 2026 17:584,55857,009,50536,783,0001,049,0002,113,536