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 3, 2026 05:28CheckHarryCheckHarryScore: 5,383Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 05:285,36754,450,30943,524,0001,023,0002,113,536
2Sep 3, 2026 05:285,37254,427,28042,555,0002,036,0002,113,536
3Sep 3, 2026 05:285,38054,614,98043,635,0001,022,0002,113,536
4Sep 3, 2026 05:285,38354,590,37142,649,0002,034,0002,113,536
5Sep 3, 2026 05:285,38355,896,62842,670,0002,014,0002,113,536
6Sep 3, 2026 05:285,45865,814,16743,193,0002,114,0002,113,536
7Sep 3, 2026 05:285,51755,650,19743,769,0002,028,0002,113,536
8Sep 3, 2026 05:285,58556,129,81745,336,0001,022,0002,113,536
9Sep 3, 2026 05:285,68857,096,17446,193,0001,021,0002,113,536