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 26, 2025 07:03E SequeiraE SequeiraScore: 121,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2025 07:03120,51170,231,13844,589,00002,326,528
2May 26, 2025 07:03121,97369,516,59243,125,0002,005,0002,482,176
3May 26, 2025 07:03123,35173,667,59843,612,0002,028,0002,326,528