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 listJun 5, 2026 13:04Victor MerckléVictor MerckléScore: 64,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 13:0564,26232,901,93022,633,0001,144,0002,113,536
2Jun 5, 2026 13:0564,35632,915,58822,687,0001,125,0002,113,536
3Jun 5, 2026 13:0564,38633,021,38822,686,0001,137,0002,113,536
4Jun 5, 2026 13:0564,48632,963,37022,727,0001,133,0002,113,536
5Jun 5, 2026 13:0564,49733,018,69122,720,0001,144,0002,113,536
6Jun 5, 2026 13:0564,55133,011,74722,738,0001,146,0002,113,536
7Jun 5, 2026 13:0564,68933,028,84922,860,0001,075,0002,113,536
8Jun 5, 2026 13:0564,84333,131,20922,856,0001,136,0002,113,536
9Jun 5, 2026 13:0564,90033,094,04922,861,0001,152,0002,113,536