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 19, 2026 00:10Victor MerckléVictor MerckléScore: 63,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 00:1162,15131,768,14422,996,00002,113,536
2Jun 19, 2026 00:1162,71030,627,43623,203,00002,113,536
3Jun 19, 2026 00:1162,75430,808,90823,219,00002,113,536
4Jun 19, 2026 00:1163,06230,916,42523,333,00002,113,536
5Jun 19, 2026 00:1163,24030,889,38623,399,00002,113,536
6Jun 19, 2026 00:1163,37530,922,42523,449,00002,113,536
7Jun 19, 2026 00:1163,42430,925,44622,467,0001,000,0002,113,536
8Jun 19, 2026 00:1163,95131,094,05423,662,00002,113,536
9Jun 19, 2026 00:1164,13531,129,81523,730,00002,113,536