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:28apuxbtapuxbtError
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:2800000Error: expected "429496509254 ", got "420906584499 "
2Sep 28, 2023 15:28111,698115,178,21541,328,38302,269,184
3Sep 28, 2023 15:28112,121112,548,10641,484,63402,273,280
4Sep 28, 2023 15:28112,863126,755,31341,759,34002,273,280