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 06:53E SequeiraE SequeiraScore: 151,914Success
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 06:53151,85482,787,94454,180,0002,006,0002,326,528
2May 26, 2025 06:53151,91477,125,41954,201,0002,007,0002,326,528
3May 26, 2025 06:53152,15781,997,21655,293,0001,005,0002,494,464