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 18, 2026 15:57Victor MerckléVictor MerckléScore: 62,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 15:5862,67230,547,41323,189,00002,113,536
2Jun 18, 2026 15:5862,77530,852,57223,227,00002,113,536
3Jun 18, 2026 15:5862,78330,650,44823,230,00002,113,536
4Jun 18, 2026 15:5862,96730,720,74123,298,00002,113,536
5Jun 18, 2026 15:5862,97530,675,74323,301,00002,113,536
6Jun 18, 2026 15:5863,08130,713,68123,340,00002,113,536
7Jun 18, 2026 15:5863,41030,895,88123,462,00002,113,536
8Jun 18, 2026 15:5863,56431,269,23423,519,00002,113,536
9Jun 18, 2026 15:5863,86431,910,32823,630,00002,113,536