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 27, 2023 19:55Franek KortaFranek KortaScore: 74,341Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2023 19:5573,95151,928,87026,349,0001,013,0002,445,312
2Aug 27, 2023 19:5574,10559,528,12126,404,0001,015,0002,437,120
3Aug 27, 2023 19:5574,11951,307,24627,424,00002,531,328
4Aug 27, 2023 19:5574,19554,142,37727,452,00002,441,216
5Aug 27, 2023 19:5574,20049,679,03027,454,00002,265,088
6Aug 27, 2023 19:5574,33853,029,07827,505,00002,441,216
7Aug 27, 2023 19:5574,34153,758,69627,506,00002,531,328
8Aug 27, 2023 19:5574,44954,191,20326,487,0001,059,0002,441,216
9Aug 27, 2023 19:5574,51650,482,84726,550,0001,021,0002,531,328
10Aug 27, 2023 19:5580,40888,433,86629,750,81102,289,664
11Aug 27, 2023 19:5580,62489,665,51229,830,91802,195,456
12Aug 27, 2023 19:5580,72590,654,38429,868,17502,281,472