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 15:29highload-churnerhighload-churnerScore: 3,195Success
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 15:303,18435,959,12526,432,000020,480
2Oct 14, 2026 15:303,18836,022,25426,468,000020,480
3Oct 14, 2026 15:303,19036,029,29626,483,000020,480
4Oct 14, 2026 15:303,19235,513,54326,496,000020,480
5Oct 14, 2026 15:303,19536,029,88926,522,000020,480
6Oct 14, 2026 15:303,19636,097,87326,532,000020,480
7Oct 14, 2026 15:303,19735,514,63526,537,000020,480
8Oct 14, 2026 15:303,19835,445,65726,545,000020,480
9Oct 14, 2026 15:303,20735,572,18626,619,000020,480