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 8, 2025 09:21warshipwarshipScore: 56,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 09:2156,059490,737,692465,293,00002,285,568
2Dec 8, 2025 09:2156,090491,926,746463,553,0001,998,0002,285,568
3Dec 8, 2025 09:2156,093489,555,929464,574,000999,0002,510,848
4Dec 8, 2025 09:2156,099494,711,873463,620,0001,998,0002,285,568
5Dec 8, 2025 09:2156,102490,378,556464,649,000999,0002,285,568
6Dec 8, 2025 09:2156,115491,328,439463,760,0001,998,0002,519,040
7Dec 8, 2025 09:2156,118496,929,090463,784,0001,999,0002,285,568
8Dec 8, 2025 09:2156,128496,178,402464,866,000999,0002,285,568
9Dec 8, 2025 09:2156,239494,149,857465,786,000999,0002,269,184