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 22, 2025 09:51Valentin KofmanValentin KofmanScore: 49,009Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 09:5148,926427,642,034405,089,0001,000,0002,269,184
2Jun 22, 2025 09:5148,942435,893,874405,218,0001,000,0002,265,088
3Jun 22, 2025 09:5148,949433,049,261406,279,00002,289,664
4Jun 22, 2025 09:5148,973431,309,604406,474,00002,396,160
5Jun 22, 2025 09:5149,009435,066,949404,776,0001,998,0002,265,088
6Jun 22, 2025 09:5149,187430,508,243407,250,0001,000,0002,269,184
7Jun 22, 2025 09:5149,208435,340,918408,427,00002,269,184
8Jun 22, 2025 09:5149,231439,849,341406,622,0001,998,0002,277,376
9Jun 22, 2025 09:5149,266431,902,072406,911,0001,999,0002,289,664