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 15:22apuxbtapuxbtScore: 112,409Success
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 15:22111,726104,140,10541,338,70602,269,184
2Sep 28, 2023 15:22112,409106,361,38741,591,50402,265,088
3Sep 28, 2023 15:22112,860100,774,17641,758,02802,260,992