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 listNov 29, 2024 21:06E SequeiraE SequeiraScore: 149,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 21:06149,73576,992,31154,395,0001,007,0002,482,176
2Nov 29, 2024 21:06149,87074,154,13054,444,0001,008,0002,490,368
3Nov 29, 2024 21:06150,03280,816,34055,512,00002,326,528