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 12, 2026 16:46highload-churnerhighload-churnerScore: 3,366Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 16:463,29736,082,21427,373,000020,480
2Oct 12, 2026 16:463,29936,254,14327,384,000020,480
3Oct 12, 2026 16:463,30036,217,13327,397,000020,480
4Oct 12, 2026 16:463,31236,307,47027,494,000020,480
5Oct 12, 2026 16:463,36636,738,79527,940,000020,480
6Oct 12, 2026 16:463,45638,189,16928,693,000020,480
7Oct 12, 2026 16:463,46337,577,65428,744,000020,480
8Oct 12, 2026 16:463,51538,632,10529,180,000020,480
9Oct 12, 2026 16:463,54038,297,06229,390,000020,480