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 22, 2023 21:35mmalczakmmalczakScore: 73,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2023 21:3572,87848,450,81224,968,0001,997,0002,289,664
2Sep 22, 2023 21:3572,96850,917,03824,999,0001,999,0002,289,664
3Sep 22, 2023 21:3573,00554,651,31425,012,0002,000,0002,273,280
4Sep 22, 2023 21:3573,10854,885,15226,049,0001,001,0002,289,664
5Sep 22, 2023 21:3573,15458,671,88626,065,0001,002,0002,289,664
6Sep 22, 2023 21:3573,27355,372,07525,103,0002,008,0002,269,184
7Sep 22, 2023 21:3573,28448,271,64126,111,0001,004,0002,289,664
8Sep 22, 2023 21:3573,48653,264,96125,176,0002,014,0002,269,184
9Sep 22, 2023 21:3573,92448,835,02625,326,0002,026,0002,531,328
10Sep 22, 2023 21:3575,95292,935,47928,102,14602,252,800
11Sep 22, 2023 21:3576,20386,368,98928,195,27602,265,088
12Sep 22, 2023 21:3576,60594,348,74628,344,01202,265,088