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:57Andrey LikhachevAndrey LikhachevScore: 70,630Success
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:5770,08651,346,10324,935,000997,0002,375,680
2Aug 4, 2024 13:5770,11650,556,13623,948,0001,995,0002,289,664
3Aug 4, 2024 13:5770,24351,525,20023,991,0001,999,0002,371,584
4Aug 4, 2024 13:5770,30549,968,26725,013,0001,000,0002,498,560
5Aug 4, 2024 13:5770,47654,403,98425,074,0001,002,0002,371,584
6Aug 4, 2024 13:5770,54148,501,11525,097,0001,003,0002,289,664
7Aug 4, 2024 13:5770,63048,312,66224,123,0002,010,0002,469,888
8Aug 4, 2024 13:5770,78447,375,12725,183,0001,007,0002,371,584
9Aug 4, 2024 13:5771,01648,714,32524,255,0002,021,0002,502,656
10Aug 4, 2024 13:5773,17895,039,78027,075,74202,342,912
11Aug 4, 2024 13:5773,94086,502,74827,357,93102,211,840
12Aug 4, 2024 13:5774,38392,892,77527,521,58002,256,896