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 19, 2025 19:23Aleksei ShahoikaAleksei ShahoikaScore: 15,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2025 19:2315,283151,215,762124,853,0001,997,0002,260,992
2Sep 19, 2025 19:2315,287149,724,661124,882,0001,998,0002,265,088
3Sep 19, 2025 19:2315,292157,716,882125,926,000999,0002,265,088
4Sep 19, 2025 19:2315,293152,702,595125,929,000999,0002,260,992
5Sep 19, 2025 19:2315,297155,745,371124,962,0001,999,0002,285,568
6Sep 19, 2025 19:2315,299151,958,588124,983,0001,999,0002,285,568
7Sep 19, 2025 19:2315,300151,252,853124,987,0001,999,0002,285,568
8Sep 19, 2025 19:2315,353152,345,663127,427,00002,285,568
9Sep 19, 2025 19:2315,358149,377,481127,469,00002,285,568