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 13:40Victor MerckléVictor MerckléScore: 63,297Success
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 13:4162,66230,783,73022,163,0001,022,0002,113,536
2Jun 10, 2026 13:4162,71030,596,82423,203,00002,113,536
3Jun 10, 2026 13:4163,13730,948,54423,361,00002,113,536
4Jun 10, 2026 13:4163,17230,945,61323,374,00002,113,536
5Jun 10, 2026 13:4163,29731,097,68723,420,00002,113,536
6Jun 10, 2026 13:4163,38630,857,88823,453,00002,113,536
7Jun 10, 2026 13:4163,41630,921,63623,464,00002,113,536
8Jun 10, 2026 13:4163,48630,912,04723,490,00002,113,536
9Jun 10, 2026 13:4163,57030,897,27223,521,00002,113,536