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 02:27CheckHarryCheckHarryScore: 4,276Success
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 02:304,23545,027,55734,142,0001,016,0002,113,536
2Sep 6, 2026 02:304,24546,246,36534,221,0001,018,0002,113,536
3Sep 6, 2026 02:304,24845,150,80334,233,0001,026,0002,113,536
4Sep 6, 2026 02:304,25745,223,73734,318,0001,019,0002,113,536
5Sep 6, 2026 02:304,27645,397,06634,480,0001,017,0002,113,536
6Sep 6, 2026 02:304,33945,916,86035,000,0001,018,0002,113,536
7Sep 6, 2026 02:304,37846,201,60135,303,0001,038,0002,113,536
8Sep 6, 2026 02:304,47247,006,37736,083,0001,038,0002,113,536
9Sep 6, 2026 02:304,49447,161,40836,289,0001,016,0002,113,536