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:24Valentin KofmanValentin KofmanScore: 65,295Success
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:2465,23546,874,54222,126,0002,011,0002,277,376
2Jul 15, 2025 18:2465,29548,236,02622,146,0002,013,0002,285,568
3Jul 15, 2025 18:2465,61445,728,09622,254,0002,023,0002,285,568