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 13:52Andrey LikhachevAndrey LikhachevScore: 70,468Success
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 13:5270,00049,700,04824,904,000996,0002,371,584
2Aug 4, 2024 13:5270,04955,343,71823,925,0001,993,0002,355,200
3Aug 4, 2024 13:5270,24151,146,73123,990,0001,999,0002,367,488
4Aug 4, 2024 13:5270,34653,515,38025,027,0001,001,0002,289,664
5Aug 4, 2024 13:5270,34654,165,07224,026,0002,002,0002,371,584
6Aug 4, 2024 13:5270,39556,381,86724,043,0002,003,0002,375,680
7Aug 4, 2024 13:5270,46852,556,18724,068,0002,005,0002,469,888
8Aug 4, 2024 13:5270,98150,117,43624,243,0002,020,0002,359,296
9Aug 4, 2024 13:5271,05448,407,51925,279,0001,011,0002,371,584
10Aug 4, 2024 13:5273,71088,693,30727,272,54202,334,720
11Aug 4, 2024 13:5274,104105,434,20127,418,30302,256,896
12Aug 4, 2024 13:5274,52289,110,38727,573,19402,207,744