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 listApr 3, 2023 22:49Yurkov AlekseyYurkov AlekseyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 22:4800000Error: No answer to stdout. Died or killed?
2Apr 3, 2023 22:49161,249125,951,12159,662,01702,273,280
3Apr 3, 2023 22:49161,301130,690,23059,681,54302,260,992
4Apr 3, 2023 22:49161,407124,824,82359,720,65902,260,992