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 28, 2025 23:25Josu San MartinJosu San MartinScore: 32,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2025 23:5232,887303,742,217270,965,0001,999,0002,519,040
2Dec 28, 2025 23:5232,897305,507,995271,047,0002,000,0002,383,872
3Dec 28, 2025 23:5232,901299,186,846272,077,0001,000,0002,523,136
4Dec 28, 2025 23:2532,912303,270,704272,171,0001,000,0002,523,136
5Dec 28, 2025 23:2532,920296,833,142271,233,0002,001,0002,387,968
6Dec 28, 2025 23:2532,944305,976,564271,443,0001,995,0002,396,160