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 26, 2025 16:17sheryllynn24sheryllynn24Score: 6,934Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 16:186,92678,147,25056,475,0001,008,0002,285,568
2Sep 26, 2025 16:186,92979,712,51856,501,0001,008,0002,285,568
3Sep 26, 2025 16:186,93189,303,14355,508,0002,018,0002,285,568
4Sep 26, 2025 16:186,93488,922,61857,549,00002,285,568
5Sep 26, 2025 16:186,93484,829,09856,544,0001,009,0002,285,568
6Sep 26, 2025 16:186,93483,175,22357,555,00002,375,680
7Sep 26, 2025 16:186,94581,548,69456,633,0001,011,0002,285,568
8Sep 26, 2025 16:186,94684,106,90155,664,0001,988,0002,265,088
9Sep 26, 2025 16:186,98682,639,86356,983,000999,0002,285,568