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:55highload-churnerhighload-churnerScore: 3,240Success
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:563,23735,874,04826,874,000020,480
2Oct 14, 2026 11:563,23735,827,92126,868,000020,480
3Oct 14, 2026 11:563,23835,820,68326,877,000020,480
4Oct 14, 2026 11:563,24035,820,87026,897,000020,480
5Oct 14, 2026 11:563,24035,823,64526,896,000020,480
6Oct 14, 2026 11:563,24535,866,82526,940,000020,480
7Oct 14, 2026 11:563,24737,407,95926,954,000020,480
8Oct 14, 2026 11:563,25035,732,07626,975,000020,480
9Oct 14, 2026 11:563,25035,968,81626,978,000020,480