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 11, 2026 08:45Victor MerckléVictor MerckléScore: 63,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 08:4662,78330,867,52923,230,00002,113,536
2Jun 11, 2026 08:4663,11031,017,27923,351,00002,113,536
3Jun 11, 2026 08:4663,12430,737,32723,356,00002,113,536
4Jun 11, 2026 08:4663,21031,005,29723,388,00002,113,536
5Jun 11, 2026 08:4663,48631,390,70523,490,00002,113,536
6Jun 11, 2026 08:4663,50031,103,10723,495,00002,113,536
7Jun 11, 2026 08:4663,64030,953,56923,547,00002,113,536
8Jun 11, 2026 08:4663,67231,180,31523,559,00002,113,536
9Jun 11, 2026 08:4663,73530,955,89623,582,00002,113,536