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 18, 2023 13:06mmalczakmmalczakScore: 93,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2023 13:0693,04361,673,50233,414,0001,012,0002,289,664
2Sep 18, 2023 13:0693,14157,312,74834,462,00002,289,664
3Sep 18, 2023 13:0693,19562,133,44633,468,0001,014,0002,289,664
4Sep 18, 2023 13:0693,22457,742,52634,493,00002,265,088
5Sep 18, 2023 13:0693,27862,113,31933,498,0001,015,0002,289,664
6Sep 18, 2023 13:0693,40056,525,72334,558,00002,269,184
7Sep 18, 2023 13:0693,81161,604,57333,690,0001,020,0002,523,136
8Sep 18, 2023 13:0694,15760,170,17032,848,0001,990,0002,379,776
9Sep 18, 2023 13:0694,15960,273,82932,849,0001,990,0002,531,328
10Sep 18, 2023 13:0696,551122,188,48835,723,93102,273,280
11Sep 18, 2023 13:0696,870102,718,28935,842,03602,256,896
12Sep 18, 2023 13:0697,18899,551,60135,959,40102,273,280