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:43highload-churnerhighload-churnerScore: 3,249Success
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:443,24135,882,06626,902,000020,480
2Oct 14, 2026 11:443,24435,843,32826,932,000020,480
3Oct 14, 2026 11:443,24736,114,04826,951,000020,480
4Oct 14, 2026 11:443,24736,536,23826,955,000020,480
5Oct 14, 2026 11:443,24937,363,57126,969,000020,480
6Oct 14, 2026 11:443,25036,564,04626,976,000020,480
7Oct 14, 2026 11:443,25136,587,42426,991,000020,480
8Oct 14, 2026 11:443,25535,947,87027,017,000020,480
9Oct 14, 2026 11:443,26336,004,85127,090,000020,480