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 3, 2022 18:32Franek KortaFranek KortaScore: 109,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2022 18:32108,14163,540,80136,011,0004,001,0002,535,424
2Aug 3, 2022 18:32108,16263,714,31438,019,0002,001,0002,281,472
3Aug 3, 2022 18:32108,27360,744,33037,057,0003,004,0002,281,472
4Aug 3, 2022 18:32108,33262,917,26638,079,0002,004,0002,281,472
5Aug 3, 2022 18:32108,34662,111,27138,084,0002,004,0002,269,184
6Aug 3, 2022 18:32108,46562,860,13038,126,0002,006,0002,281,472
7Aug 3, 2022 18:32109,36262,470,01338,441,0002,023,0002,527,232
8Aug 3, 2022 18:32109,43869,436,47738,468,0002,024,0002,273,280
9Aug 3, 2022 18:32109,48660,746,65239,498,0001,012,0002,281,472
10Aug 3, 2022 18:32111,367119,655,84441,205,70402,248,704
11Aug 3, 2022 18:32111,613111,893,35641,296,80702,252,800
12Aug 3, 2022 18:32113,614106,647,20542,037,34602,260,992