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 4, 2024 14:20Andrey LikhachevAndrey LikhachevScore: 70,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2024 14:2070,02250,255,16424,912,000996,0002,367,488
2Aug 4, 2024 14:2070,15951,769,10123,963,0001,996,0002,363,392
3Aug 4, 2024 14:2070,24150,931,28123,990,0001,999,0002,367,488
4Aug 4, 2024 14:2070,48649,329,34324,074,0002,006,0002,502,656
5Aug 4, 2024 14:2070,55755,893,44225,102,0001,004,0002,375,680
6Aug 4, 2024 14:2070,61650,484,39724,119,0002,009,0002,379,776
7Aug 4, 2024 14:2070,63251,424,67424,124,0002,010,0002,375,680
8Aug 4, 2024 14:2070,63849,797,71824,126,0002,010,0002,375,680
9Aug 4, 2024 14:2070,77052,075,36425,178,0001,007,0002,371,584
10Aug 4, 2024 14:2073,691100,468,90827,265,57102,260,992
11Aug 4, 2024 14:2073,716102,274,30727,274,97502,207,744
12Aug 4, 2024 14:2073,82595,797,56127,315,14002,273,280