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 listAug 3, 2022 18:57Franek KortaFranek KortaScore: 101,035Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2022 18:5798,14366,204,99134,296,0002,017,0002,281,472
2Aug 3, 2022 18:5798,59265,216,36135,466,0001,013,0002,281,472
3Aug 3, 2022 18:5798,87662,555,56135,568,0001,016,0002,273,280
4Aug 3, 2022 18:5799,20066,588,44836,704,00002,281,472
5Aug 3, 2022 18:57100,26861,646,13435,094,0002,005,0002,281,472
6Aug 3, 2022 18:57100,48461,531,32335,170,0002,009,0002,273,280
7Aug 3, 2022 18:57101,03556,949,06937,383,00002,392,064
8Aug 3, 2022 18:57101,324101,967,56337,489,83602,265,088
9Aug 3, 2022 18:57102,266103,614,79737,838,53502,256,896
10Aug 3, 2022 18:57102,507113,055,56337,927,68202,260,992
11Aug 3, 2022 18:57102,52462,802,54735,938,0001,996,0002,281,472
12Aug 3, 2022 18:57102,55764,366,06135,949,0001,997,0002,281,472