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 11, 2021 08:07Andrey TsvetkovAndrey TsvetkovScore: 86,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2021 08:0785,21956,170,86731,531,00002,428,928
2Sep 11, 2021 08:0785,22454,101,79930,516,0001,017,0002,445,312
3Sep 11, 2021 08:0785,32454,481,62130,552,0001,018,0002,334,720
4Sep 11, 2021 08:0785,57358,688,38530,641,0001,021,0002,445,312
5Sep 11, 2021 08:0785,74658,455,24729,680,0002,046,0002,437,120
6Sep 11, 2021 08:0786,07856,055,38230,854,000995,0002,428,928
7Sep 11, 2021 08:0786,11159,281,79729,870,0001,991,0002,441,216
8Sep 11, 2021 08:0786,13258,777,03029,878,0001,991,0002,334,720
9Sep 11, 2021 08:0786,22756,325,49028,913,0002,991,0002,334,720
10Sep 11, 2021 08:0788,720101,709,86132,826,38502,220,032
11Sep 11, 2021 08:0788,83599,797,50632,868,84102,220,032
12Sep 11, 2021 08:0789,56694,038,24233,139,41502,228,224