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 2, 2023 22:48Franek KortaFranek KortaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2023 22:4800000Error: expected "429496524311 ", got "429496520072"stderr
2Sep 2, 2023 22:4800000Error: expected "429496487935 ", got "429496486523"stderr
3Sep 2, 2023 22:4864,77691,250,19523,966,96802,224,128
4Sep 2, 2023 22:4864,80884,987,25923,979,11402,170,880
5Sep 2, 2023 22:4865,124104,261,92524,095,99202,289,664