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:27Franek 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 29, 2023 20:2764,44352,842,85222,851,000993,0002,531,328
2Aug 29, 2023 20:2764,46248,658,43422,858,000993,0002,531,328
3Aug 29, 2023 20:2764,50050,236,17322,871,000994,0002,437,120
4Aug 29, 2023 20:2764,51452,097,18422,876,000994,0002,269,184
5Aug 29, 2023 20:2764,59246,271,91321,908,0001,991,0002,527,232
6Aug 29, 2023 20:2764,64646,645,62422,923,000996,0002,437,120
7Aug 29, 2023 20:2764,84950,006,83822,995,000999,0002,527,232
8Aug 29, 2023 20:2764,86545,759,11623,000,0001,000,0002,441,216
9Aug 29, 2023 20:2764,90346,495,23621,013,0003,001,0002,437,120
10Aug 29, 2023 20:2769,46790,829,94325,702,76502,301,952
11Aug 29, 2023 20:2769,77984,530,66925,818,07602,289,664
12Aug 29, 2023 20:2769,95581,212,15625,883,53302,293,760