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 14, 2026 11:57highload-churnerhighload-churnerScore: 22,161Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2026 11:5722,057192,125,676183,081,000024,576stderr
2Oct 14, 2026 11:5722,093193,020,384183,374,000024,576stderr
3Oct 14, 2026 11:5722,145193,264,255183,808,000024,576stderr
4Oct 14, 2026 11:5722,159192,974,682183,926,000024,576stderr
5Oct 14, 2026 11:5722,161193,066,263183,938,000024,576stderr
6Oct 14, 2026 11:5722,173193,066,053183,007,0001,032,00024,576stderr
7Oct 14, 2026 11:5722,178193,526,912183,014,0001,066,00024,576stderr
8Oct 14, 2026 11:5722,187193,105,383184,157,000024,576stderr
9Oct 14, 2026 11:5722,245193,629,485183,631,0001,010,00024,576stderr