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 14:21Aman | अमनAman | अमनScore: 53,329Success
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 14:2153,306470,463,440442,443,00002,523,136
2Dec 29, 2025 14:2153,311473,776,814441,481,0001,001,0002,519,040
3Dec 29, 2025 14:2153,327469,104,268441,619,000999,0002,519,040
4Dec 29, 2025 14:2153,328469,178,075441,621,000999,0002,478,080
5Dec 29, 2025 14:2153,329472,732,028441,632,000999,0002,383,872
6Dec 29, 2025 14:2153,330473,039,238442,642,00002,523,136
7Dec 29, 2025 14:2153,331470,512,824441,647,000999,0002,519,040
8Dec 29, 2025 14:2153,332473,055,592441,657,000999,0002,260,992
9Dec 29, 2025 14:2153,333478,957,918440,666,0001,998,0002,387,968