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:13Yurkov AlekseyYurkov AlekseyScore: 167,276Success
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:13101,629111,312,27037,602,73202,269,184
2Sep 1, 2022 00:13102,51488,586,24837,930,14602,256,896
3Sep 1, 2022 00:13103,88890,529,74038,438,46902,269,184
4Sep 1, 2022 00:13166,58487,935,79161,636,00002,289,664
5Sep 1, 2022 00:13167,03287,627,05159,809,0001,993,0002,269,184
6Sep 1, 2022 00:13167,20085,025,48059,869,0001,995,0002,281,472
7Sep 1, 2022 00:13167,27684,862,25460,894,000998,0002,289,664
8Sep 1, 2022 00:13167,48486,805,84759,970,0001,999,0002,289,664
9Sep 1, 2022 00:13167,69285,218,83760,045,0002,001,0002,289,664
10Sep 1, 2022 00:13167,98688,275,45360,150,0002,005,0002,289,664
11Sep 1, 2022 00:13169,21693,117,33061,601,0001,009,0002,273,280
12Sep 1, 2022 00:13169,80588,518,36561,831,000997,0002,277,376