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 25, 2023 22:14mmalczakmmalczakError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2023 22:1400000Error: expected "429496528394 ", got "429496528381 "
2Sep 25, 2023 22:1574,10896,463,61727,420,12602,265,088
3Sep 25, 2023 22:1574,17387,103,50227,444,16102,265,088
4Sep 25, 2023 22:1574,798102,172,80827,675,12402,269,184