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:13highload-churnerhighload-churnerScore: 3,465Success
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:133,40337,148,21328,246,000020,480
2Oct 14, 2026 11:133,44539,978,15828,598,000020,480
3Oct 14, 2026 11:133,45538,104,97228,682,000020,480
4Oct 14, 2026 11:133,45937,713,06428,714,000020,480
5Oct 14, 2026 11:133,46537,802,89128,761,000020,480
6Oct 14, 2026 11:133,46638,358,02528,770,000020,480
7Oct 14, 2026 11:133,46737,581,33928,784,000020,480
8Oct 14, 2026 11:133,46837,668,86228,792,000020,480
9Oct 14, 2026 11:133,47337,708,68528,829,000020,480