TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listSep 16, 2023 16:56mmalczakmmalczakScore: 95,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 16:5694,090105,345,83934,813,38102,269,184
2Sep 16, 2023 16:5694,320106,154,10334,898,22602,252,800
3Sep 16, 2023 16:5695,08958,719,55933,173,0002,010,0002,281,472
4Sep 16, 2023 16:5695,12456,959,88033,185,0002,011,0002,289,664
5Sep 16, 2023 16:5695,19558,146,88733,210,0002,012,0002,289,664
6Sep 16, 2023 16:5695,19757,523,86933,211,0002,012,0002,289,664
7Sep 16, 2023 16:5695,216103,176,38135,229,98302,273,280
8Sep 16, 2023 16:5696,24661,587,20435,611,00002,289,664
9Sep 16, 2023 16:5696,44361,699,11834,665,0001,019,0002,289,664
10Sep 16, 2023 16:5696,75763,536,82434,806,000994,0002,289,664
11Sep 16, 2023 16:5696,82464,395,33833,835,0001,990,0002,289,664
12Sep 16, 2023 16:5697,24959,459,86533,983,0001,999,0002,277,376