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 9, 2026 21:53highload-churnerhighload-churnerScore: 3,366Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 22:473,26235,935,22727,076,000020,480
2Oct 9, 2026 22:473,27536,062,71127,185,000020,480
3Oct 9, 2026 22:473,27535,986,05927,186,000020,480
4Oct 9, 2026 22:473,28836,190,38126,283,0001,014,00020,480
5Oct 9, 2026 22:473,36636,746,12527,940,000020,480
6Oct 9, 2026 22:473,41637,177,95328,355,000020,480
7Oct 9, 2026 22:473,42237,852,16528,407,000020,480
8Oct 9, 2026 22:473,44037,974,11128,552,000020,480
9Oct 9, 2026 22:473,46137,568,25628,727,000020,480