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 listJan 29, 2024 15:08AnSaAnSaScore: 93,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2024 15:0892,69256,443,66132,279,0002,017,0002,269,184
2Jan 29, 2024 15:0892,73058,959,46732,292,0002,018,0002,277,376
3Jan 29, 2024 15:0892,75956,470,89832,303,0002,018,0002,531,328
4Jan 29, 2024 15:0892,81160,790,05432,320,0002,020,0002,527,232
5Jan 29, 2024 15:0892,83059,161,25128,286,0006,061,0002,523,136
6Jan 29, 2024 15:0892,84962,065,59930,313,0004,041,0002,277,376
7Jan 29, 2024 15:0893,64363,956,08033,629,0001,019,0002,265,088
8Jan 29, 2024 15:0893,67861,242,16134,661,00002,277,376
9Jan 29, 2024 15:0893,80862,443,59533,689,0001,020,0002,277,376
10Jan 29, 2024 15:0896,82399,220,38435,824,69302,265,088
11Jan 29, 2024 15:0897,042101,806,24535,905,69902,265,088
12Jan 29, 2024 15:0898,459104,607,63436,429,93702,260,992