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 17:59Valentin KofmanValentin KofmanScore: 67,068Success
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 17:5966,50553,591,39123,582,0001,025,0002,387,968
2Jul 15, 2025 17:5966,53049,723,35023,591,0001,025,0002,269,184
3Jul 15, 2025 17:5966,56551,013,53924,629,00002,392,064
4Jul 15, 2025 17:5966,80356,449,75523,688,0001,029,0002,392,064
5Jul 15, 2025 17:5967,06858,081,91924,815,00002,269,184
6Jul 15, 2025 17:5967,14956,127,32322,858,0001,987,0002,269,184
7Jul 15, 2025 17:5967,17054,985,63223,859,000994,0002,396,160
8Jul 15, 2025 17:5967,17350,004,08222,866,0001,988,0002,269,184
9Jul 15, 2025 17:5967,19247,129,61324,861,00002,269,184