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 00:41izotoffizotoffScore: 62,044Success
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 00:4262,012545,608,331511,705,0002,998,0002,543,616
2Nov 9, 2025 00:4262,020542,080,430513,769,000999,0002,543,616
3Nov 9, 2025 00:4162,027541,920,527512,825,0001,999,0002,543,616
4Nov 9, 2025 00:4162,044533,821,737511,968,0002,999,0002,543,616
5Nov 9, 2025 00:4262,059535,266,563514,088,0001,000,0002,543,616
6Nov 9, 2025 00:4162,060544,349,797513,102,0002,000,0002,514,944