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 03:40CheckHarryCheckHarryScore: 3,825Success
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 03:413,81141,510,45930,628,0001,008,0002,113,536
2Sep 6, 2026 03:413,81641,569,02230,664,0001,011,0002,113,536
3Sep 6, 2026 03:413,81942,786,05430,690,0001,011,0002,113,536
4Sep 6, 2026 03:413,82441,680,20830,726,0001,017,0002,113,536
5Sep 6, 2026 03:413,82541,571,46330,744,0001,009,0002,113,536
6Sep 6, 2026 03:413,82941,696,11630,776,0001,010,0002,113,536
7Sep 6, 2026 03:413,94942,668,74831,766,0001,017,0002,113,536
8Sep 6, 2026 03:413,97542,806,93531,984,0001,014,0002,113,536
9Sep 6, 2026 03:414,02343,403,33132,360,0001,035,0002,113,536