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 listOct 13, 2026 09:40highload-churnerhighload-churnerScore: 35,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 09:4034,912298,668,776289,773,000024,576stderr
2Oct 13, 2026 09:4034,945299,552,248289,041,0001,009,00024,576stderr
3Oct 13, 2026 09:4034,957299,057,134289,130,0001,014,00024,576stderr
4Oct 13, 2026 09:4035,001299,328,654290,516,000024,576stderr
5Oct 13, 2026 09:4035,007299,387,199290,566,000024,576stderr
6Oct 13, 2026 09:4035,011299,567,278290,599,000024,576stderr
7Oct 13, 2026 09:4035,037300,194,400290,809,000024,576stderr
8Oct 13, 2026 09:4035,118300,959,840291,483,000024,576stderr
9Oct 13, 2026 09:4035,182301,483,080292,015,000024,576stderr