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 listMar 25, 2023 17:11Yurkov AlekseyYurkov AlekseyScore: 99,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2023 17:1198,50358,688,76735,434,0001,012,0002,289,664
2Mar 25, 2023 17:1198,70858,745,26136,522,00002,289,664
3Mar 25, 2023 17:1198,76268,859,45935,527,0001,015,0002,289,664
4Mar 25, 2023 17:1198,93063,387,52435,588,0001,016,0002,277,376
5Mar 25, 2023 17:1199,18462,751,86535,679,0001,019,0002,289,664
6Mar 25, 2023 17:1199,52463,045,93735,829,000995,0002,289,664
7Mar 25, 2023 17:1199,53866,747,26534,839,0001,990,0002,277,376
8Mar 25, 2023 17:1199,54665,386,59434,842,0001,990,0002,273,280
9Mar 25, 2023 17:11100,04661,415,04435,017,0002,000,0002,281,472
10Mar 25, 2023 17:11132,862124,576,82249,158,83802,265,088
11Mar 25, 2023 17:11133,150111,958,47749,265,59702,260,992
12Mar 25, 2023 17:11133,422106,036,79749,365,97602,252,800