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:41izotoffizotoffScore: 57,179Success
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:4157,148495,593,939474,325,00002,371,584
2Nov 9, 2025 07:4157,154502,232,390472,380,0002,001,0002,281,472
3Nov 9, 2025 07:4157,161504,167,329473,439,0001,000,0002,502,656
4Nov 9, 2025 07:4157,164500,815,552473,459,0001,000,0002,543,616
5Nov 9, 2025 07:4157,179503,166,435472,589,0001,998,0002,502,656
6Nov 9, 2025 07:4157,182499,798,315474,608,00002,543,616
7Nov 9, 2025 07:4157,183502,116,439471,618,0002,997,0002,342,912
8Nov 9, 2025 07:4157,197505,543,923471,739,0002,998,0002,498,560
9Nov 9, 2025 07:4157,198504,783,447472,744,0001,998,0002,498,560