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 12, 2025 11:51Aliaksandr MikheiAliaksandr MikheiScore: 90,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 11:5190,220772,261,001690,841,00057,986,0002,277,376
2Nov 12, 2025 11:5190,242774,613,019692,010,00057,000,0002,285,568
3Nov 12, 2025 11:5190,258771,890,620692,129,00057,010,0002,285,568
4Nov 12, 2025 11:5190,301780,066,980696,532,00052,964,0002,285,568
5Nov 12, 2025 11:5190,327774,153,769677,739,00071,972,0002,510,848
6Nov 12, 2025 11:5190,334775,311,663679,791,00069,978,0002,285,568
7Nov 12, 2025 11:5190,381778,304,935675,146,00075,016,0002,273,280
8Nov 12, 2025 11:5190,436779,014,522673,655,00076,960,0002,265,088
9Nov 12, 2025 11:5190,451772,619,307728,749,00021,992,0002,383,872