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 17:42Franek KortaFranek KortaScore: 78,441Success
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 17:4278,01652,488,48525,880,0002,986,0002,281,472
2Aug 6, 2022 17:4278,23554,176,60126,951,0001,996,0002,281,472
3Aug 6, 2022 17:4278,24154,641,66426,953,0001,996,0002,281,472
4Aug 6, 2022 17:4278,32451,432,69926,982,0001,998,0002,281,472
5Aug 6, 2022 17:4278,34649,897,63625,990,0002,998,0002,281,472
6Aug 6, 2022 17:4278,38457,554,07026,002,0003,000,0002,281,472
7Aug 6, 2022 17:4278,44150,731,50427,022,0002,001,0002,527,232
8Aug 6, 2022 17:4278,52452,186,91826,049,0003,005,0002,379,776
9Aug 6, 2022 17:4278,71951,954,43026,113,0003,013,0002,359,296
10Aug 6, 2022 17:4283,59391,640,59430,929,56402,265,088
11Aug 6, 2022 17:4283,69892,559,53330,968,29302,260,992
12Aug 6, 2022 17:4283,84498,465,91031,022,37102,285,568