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 listMay 6, 2024 21:45Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2024 21:4500000Error: expected "429496460209 ", got "390841800166 "
2May 6, 2024 21:4500000Error: expected "429496467501 ", got "403726693799 "
3May 6, 2024 21:45412,730215,873,288152,710,14502,293,760
4May 6, 2024 21:45414,185208,264,899153,248,48202,285,568
5May 6, 2024 21:45415,684216,256,803153,803,14302,301,952