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 10, 2026 16:05Victor MerckléVictor MerckléScore: 62,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 16:0662,36230,461,33123,074,00002,113,536
2Jun 10, 2026 16:0662,58130,644,26223,155,00002,113,536
3Jun 10, 2026 16:0662,58330,562,37423,156,00002,113,536
4Jun 10, 2026 16:0662,77830,589,69023,228,00002,113,536
5Jun 10, 2026 16:0662,94530,971,01823,290,00002,113,536
6Jun 10, 2026 16:0663,06730,735,60023,335,00002,113,536
7Jun 10, 2026 16:0663,47531,004,21523,486,00002,113,536
8Jun 10, 2026 16:0663,49431,152,13623,493,00002,113,536
9Jun 10, 2026 16:0663,84531,043,25923,623,00002,113,536