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 listDec 30, 2025 13:06Yehor BondarYehor BondarScore: 75,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 13:0675,577659,525,105626,293,0001,000,0002,387,968
2Dec 30, 2025 13:0675,580656,422,834627,315,00002,383,872
3Dec 30, 2025 13:0675,602653,919,780625,495,0001,998,0002,527,232
4Dec 30, 2025 13:0675,898661,057,525628,952,000999,0002,260,992
5Dec 30, 2025 13:0675,900656,279,376628,971,000999,0002,371,584
6Dec 30, 2025 13:0675,917652,701,990629,111,0001,000,0002,523,136
7Dec 30, 2025 13:0675,919651,207,053629,125,0001,000,0002,375,680
8Dec 30, 2025 13:0675,950658,390,386630,386,00002,523,136
9Dec 30, 2025 13:0675,960657,603,599628,470,0001,998,0002,514,944