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 1, 2022 00:36Yurkov AlekseyYurkov AlekseyScore: 167,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2022 00:36125,049111,064,38146,268,00002,265,088
2Sep 1, 2022 00:36125,234112,690,34746,336,75602,269,184
3Sep 1, 2022 00:36125,896102,293,87746,581,44102,269,184
4Sep 1, 2022 00:36165,86284,316,91459,357,0002,012,0002,289,664
5Sep 1, 2022 00:36166,21489,628,95059,483,0002,016,0002,289,664
6Sep 1, 2022 00:36167,09286,938,79760,827,000997,0002,289,664
7Sep 1, 2022 00:36167,10587,572,24559,835,0001,994,0002,383,872
8Sep 1, 2022 00:36167,21487,952,16460,872,000997,0002,273,280
9Sep 1, 2022 00:36167,28183,994,59759,898,0001,996,0002,273,280
10Sep 1, 2022 00:36167,52784,840,42459,986,0001,999,0002,523,136
11Sep 1, 2022 00:36167,77081,775,34260,073,0002,002,0002,281,472
12Sep 1, 2022 00:36168,62793,099,09360,380,0002,012,0002,289,664