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 24, 2026 05:05wnwnScore: 3,813Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 05:063,69241,304,62629,642,0001,004,0002,113,536
2Sep 24, 2026 05:063,70439,683,45929,711,0001,039,0002,113,536
3Sep 24, 2026 05:063,78940,249,85930,449,0001,006,0002,113,536
4Sep 24, 2026 05:063,80741,030,22330,599,0001,004,0002,113,536
5Sep 24, 2026 05:063,81341,130,24830,622,0001,029,0002,113,536
6Sep 24, 2026 05:063,82040,973,09430,683,0001,029,0002,113,536
7Sep 24, 2026 05:063,83141,286,04730,797,0001,004,0002,113,536
8Sep 24, 2026 05:063,83641,278,49530,815,0001,029,0002,113,536
9Sep 24, 2026 05:063,84040,639,29730,833,0001,040,0002,113,536