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 listSep 28, 2023 16:53apuxbtapuxbtScore: 81,006Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 16:5380,79293,966,94829,893,11702,265,088
2Sep 28, 2023 16:5381,006100,122,70529,972,40302,265,088
3Sep 28, 2023 16:5381,60294,535,81630,192,59202,265,088