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 28, 2023 21:31Franek KortaFranek KortaScore: 64,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 21:3164,45747,599,91622,856,000993,0002,445,312
2Aug 28, 2023 21:3164,47848,585,58823,857,00002,269,184
3Aug 28, 2023 21:3164,50345,973,76221,878,0001,988,0002,527,232
4Aug 28, 2023 21:3164,57652,034,03622,898,000995,0002,437,120
5Aug 28, 2023 21:3164,61650,328,49722,912,000996,0002,433,024
6Aug 28, 2023 21:3164,68648,213,86021,940,0001,994,0002,437,120
7Aug 28, 2023 21:3164,84944,394,50521,995,0001,999,0002,441,216
8Aug 28, 2023 21:3164,93047,408,73823,023,0001,001,0002,441,216
9Aug 28, 2023 21:3164,99748,601,66823,047,0001,002,0002,269,184
10Aug 28, 2023 21:3169,89777,667,08025,861,72802,285,568
11Aug 28, 2023 21:3170,001100,324,47225,900,20002,293,760
12Aug 28, 2023 21:3170,38689,812,87926,042,87502,285,568