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 21, 2025 15:33Valentin KofmanValentin KofmanScore: 75,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 15:3375,577652,238,659627,293,00002,285,568
2Jun 21, 2025 15:3375,582657,177,963626,331,0001,000,0002,285,568
3Jun 21, 2025 15:3375,585651,668,265626,353,0001,000,0002,285,568
4Jun 21, 2025 15:3375,585656,018,142626,352,0001,000,0002,265,088
5Jun 21, 2025 15:3375,606656,121,450627,527,00002,527,232
6Jun 21, 2025 15:3375,609646,079,425625,557,0001,998,0002,289,664
7Jun 21, 2025 15:3375,610656,492,708626,563,000999,0002,277,376
8Jun 21, 2025 15:3375,617651,382,725625,626,0001,998,0002,285,568
9Jun 21, 2025 15:3375,689650,973,744627,222,0001,000,0002,523,136