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 29, 2023 20:28Franek KortaFranek KortaScore: 64,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 29, 2023 20:2864,45752,832,50022,856,000993,0002,531,328
2Aug 29, 2023 20:2864,45948,797,03722,857,000993,0002,433,024
3Aug 29, 2023 20:2864,47051,617,32722,861,000993,0002,437,120
4Aug 29, 2023 20:2864,48146,533,11522,821,0001,037,0002,527,232
5Aug 29, 2023 20:2864,48649,537,64822,866,000994,0002,441,216
6Aug 29, 2023 20:2864,59247,107,42723,899,00002,527,232
7Aug 29, 2023 20:2864,64349,187,18222,922,000996,0002,265,088
8Aug 29, 2023 20:2864,72249,985,14522,950,000997,0002,269,184
9Aug 29, 2023 20:2864,94643,484,25823,029,0001,001,0002,531,328
10Aug 29, 2023 20:2868,66795,815,67925,406,71802,293,760
11Aug 29, 2023 20:2868,80688,998,29025,458,36002,289,664
12Aug 29, 2023 20:2869,29782,610,52925,639,85102,293,760