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:50Franek KortaFranek KortaScore: 78,643Success
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:5078,08453,820,37325,903,0002,988,0002,281,472
2Aug 6, 2022 17:5078,26849,471,06826,962,0001,997,0002,281,472
3Aug 6, 2022 17:5078,29250,714,72626,971,0001,997,0002,281,472
4Aug 6, 2022 17:5078,31152,917,12026,977,0001,998,0002,527,232
5Aug 6, 2022 17:5078,31450,420,81226,978,0001,998,0002,371,584
6Aug 6, 2022 17:5078,49553,401,78327,040,0002,003,0002,523,136
7Aug 6, 2022 17:5078,64355,826,33127,092,0002,006,0002,281,472
8Aug 6, 2022 17:5078,67350,028,94127,102,0002,007,0002,527,232
9Aug 6, 2022 17:5079,29552,206,73028,328,0001,011,0002,281,472
10Aug 6, 2022 17:5083,75793,882,35330,989,94302,256,896
11Aug 6, 2022 17:5083,902119,088,47131,043,80602,265,088
12Aug 6, 2022 17:5084,05996,409,54531,101,90302,260,992