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 listJun 23, 2025 20:24Valentin KofmanValentin KofmanScore: 10,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 20:247,74486,203,89762,271,0002,008,0002,277,376
2Jun 23, 2025 20:247,75991,396,33063,395,0001,006,0002,289,664
3Jun 23, 2025 20:247,78996,657,55564,648,00002,289,664
4Jun 23, 2025 20:2410,858118,229,80388,122,0002,002,0002,289,664
5Jun 23, 2025 20:2410,903118,198,60989,487,0001,005,0002,383,872
6Jun 23, 2025 20:2410,964112,221,74189,000,0002,000,0002,285,568