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 listJul 15, 2025 18:54Valentin KofmanValentin KofmanScore: 63,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 18:5463,49545,898,39322,472,0001,021,0002,510,848
2Jul 15, 2025 18:5463,50848,296,55722,477,0001,021,0002,269,184
3Jul 15, 2025 18:5464,44150,653,63023,843,00002,269,184