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 29, 2025 21:15Павел РатмановПавел РатмановScore: 46,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 21:1546,676410,694,860387,408,00002,273,280
2Dec 29, 2025 21:1546,680416,005,375386,443,0001,001,0002,531,328
3Dec 29, 2025 21:1546,704416,360,057387,642,00002,273,280
4Dec 29, 2025 21:1546,705416,259,141386,650,000999,0002,273,280
5Dec 29, 2025 21:1546,705417,750,909385,655,0001,998,0002,269,184
6Dec 29, 2025 21:1546,709411,004,619385,687,0001,998,0002,523,136
7Dec 29, 2025 21:1546,710415,042,864385,692,0001,998,0002,269,184
8Dec 29, 2025 21:1546,847411,823,484386,833,0001,999,0002,273,280
9Dec 29, 2025 21:1546,863419,828,603385,964,0002,999,0002,269,184