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 27, 2025 03:01zypehzypehScore: 65,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 03:0165,473569,596,577541,423,0002,005,0002,359,296
2Dec 27, 2025 03:0165,514570,036,218542,765,000999,0002,375,680
3Dec 27, 2025 03:0165,620570,728,868543,646,000999,0002,347,008
4Dec 27, 2025 03:0165,715574,652,651543,438,0001,997,0002,347,008
5Dec 27, 2025 03:0165,753572,374,929543,754,0001,999,0002,375,680
6Dec 27, 2025 03:0165,798572,906,633543,124,0003,000,0002,347,008
7Dec 27, 2025 03:0165,841575,206,741546,478,00002,338,816
8Dec 27, 2025 03:0165,866577,780,097544,691,0001,998,0002,342,912
9Dec 27, 2025 03:0165,923572,072,352547,161,00002,347,008