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 listFeb 15, 2023 18:38LiamLiamError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2023 18:3800000Error: No answer to stdout. Died or killed?stderr
2Feb 15, 2023 18:3800000Error: No answer to stdout. Died or killed?stderr
3Feb 15, 2023 18:3900000Error: No answer to stdout. Died or killed?stderr
4Feb 15, 2023 18:39112,08996,711,85441,472,91802,260,992
5Feb 15, 2023 18:39112,35795,215,33041,572,24002,260,992
6Feb 15, 2023 18:39113,187116,574,43341,879,32102,277,376