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 00:27highload-churnerhighload-churnerScore: 3,487Success
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 00:273,30136,349,14627,406,000020,480
2Oct 13, 2026 00:273,43537,619,88628,513,000020,480
3Oct 13, 2026 00:273,47438,305,92528,837,000020,480
4Oct 13, 2026 00:273,48337,819,16228,909,000020,480
5Oct 13, 2026 00:273,48738,083,39328,949,000020,480
6Oct 13, 2026 00:273,50137,963,68829,060,000020,480
7Oct 13, 2026 00:273,51938,031,55028,209,0001,004,00020,480
8Oct 13, 2026 00:273,53338,158,23329,330,000020,480
9Oct 13, 2026 00:273,53438,111,36629,334,000020,480