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 24, 2026 18:12Victor MerckléVictor MerckléScore: 165,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 18:13163,86269,696,19213,347,00047,282,0002,113,536
2Jun 24, 2026 18:13164,17869,831,41013,253,00047,493,0002,113,536
3Jun 24, 2026 18:13165,43270,267,90213,175,00048,035,0002,113,536
4Jun 24, 2026 18:13165,48670,655,93213,096,00048,134,0002,113,536
5Jun 24, 2026 18:13165,66270,377,19713,203,00048,092,0002,113,536
6Jun 24, 2026 18:13165,72170,393,35413,289,00048,028,0002,113,536
7Jun 24, 2026 18:13165,88970,403,14413,465,00047,914,0002,113,536
8Jun 24, 2026 18:13165,96470,476,70013,412,00047,995,0002,113,536
9Jun 24, 2026 18:13166,14070,529,23513,236,00048,236,0002,113,536