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 6, 2022 19:24Franek KortaFranek KortaScore: 74,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 19:2474,09748,928,08025,386,0002,030,0002,273,280
2Aug 6, 2022 19:2474,14149,055,16625,400,0002,032,0002,273,280
3Aug 6, 2022 19:2474,14150,777,45826,416,0001,016,0002,281,472
4Aug 6, 2022 19:2474,18950,280,92426,434,0001,016,0002,285,568
5Aug 6, 2022 19:2474,30553,462,65525,457,0002,036,0002,535,424
6Aug 6, 2022 19:2474,38454,338,38325,484,0002,038,0002,281,472
7Aug 6, 2022 19:2474,44354,480,91926,524,0001,020,0002,527,232
8Aug 6, 2022 19:2474,44351,055,40625,504,0002,040,0002,531,328
9Aug 6, 2022 19:2474,51449,221,26425,528,0002,042,0002,527,232
10Aug 6, 2022 19:2478,20897,595,01428,936,84202,265,088
11Aug 6, 2022 19:2478,48094,513,28629,037,49302,256,896
12Aug 6, 2022 19:2478,621107,285,86429,089,73602,252,800