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 listJul 7, 2026 19:25Victor MerckléVictor MerckléScore: 67,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 19:2665,76232,147,55024,332,00002,113,536
2Jul 7, 2026 19:2666,30032,494,58524,531,00002,113,536
3Jul 7, 2026 19:2666,78932,616,44224,712,00002,113,536
4Jul 7, 2026 19:2666,80532,753,26924,718,00002,113,536
5Jul 7, 2026 19:2667,63532,846,82725,025,00002,113,536
6Jul 7, 2026 19:2668,55133,262,46825,364,00002,113,536
7Jul 7, 2026 19:2670,84534,198,83826,213,00002,113,536
8Jul 7, 2026 19:2671,44534,288,36426,435,00002,113,536
9Jul 7, 2026 19:2671,75634,350,85526,550,00002,113,536