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 15:14highload-churnerhighload-churnerScore: 3,316Success
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 15:153,29737,263,32927,370,000020,480
2Oct 12, 2026 15:153,30036,358,64227,393,000020,480
3Oct 12, 2026 15:153,31336,490,33027,501,000020,480
4Oct 12, 2026 15:153,31336,414,46327,505,000020,480
5Oct 12, 2026 15:153,31636,519,43427,531,000020,480
6Oct 12, 2026 15:153,34736,792,56827,787,000020,480
7Oct 12, 2026 15:153,35436,830,86527,843,000020,480
8Oct 12, 2026 15:153,35736,855,01727,870,000020,480
9Oct 12, 2026 15:153,50338,067,05929,075,000020,480