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 listNov 9, 2025 07:36izotoffizotoffScore: 58,389Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2025 07:3658,373511,462,268481,503,0002,996,0002,519,040
2Nov 9, 2025 07:3658,376509,214,075484,518,00002,543,616
3Nov 9, 2025 07:3658,387513,682,916482,611,0001,998,0002,543,616
4Nov 9, 2025 07:3658,387509,347,074481,617,0002,997,0002,543,616
5Nov 9, 2025 07:3658,389510,463,130482,629,0001,998,0002,514,944
6Nov 9, 2025 07:3658,401515,055,063480,731,0003,997,0002,347,008
7Nov 9, 2025 07:3658,428509,065,580483,955,000999,0002,514,944
8Nov 9, 2025 07:3658,458509,840,034483,200,0002,000,0002,543,616
9Nov 9, 2025 07:3658,481511,645,157483,394,0002,001,0002,514,944