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:48Valentin KofmanValentin KofmanScore: 65,373Success
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:4865,10351,601,48622,081,0002,007,0002,285,568
2Jul 15, 2025 18:4865,37356,410,44922,173,0002,015,0002,285,568
3Jul 15, 2025 18:4865,68652,971,93923,332,000972,0002,285,568