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:27highload-churnerhighload-churnerScore: 3,193Success
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:273,18135,364,85826,406,000020,480
2Oct 14, 2026 15:273,18635,395,67626,449,000020,480
3Oct 14, 2026 15:273,18635,426,52926,452,000020,480
4Oct 14, 2026 15:273,19136,017,90826,487,000020,480
5Oct 14, 2026 15:273,19335,762,04426,506,000020,480
6Oct 14, 2026 15:273,19435,498,03226,513,000020,480
7Oct 14, 2026 15:273,19935,566,33326,559,000020,480
8Oct 14, 2026 15:273,20035,621,80626,567,000020,480
9Oct 14, 2026 15:273,20636,146,52526,612,000020,480