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 5, 2026 13:30Victor MerckléVictor MerckléScore: 64,537Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 13:3164,16732,783,53422,688,0001,054,0002,113,536
2Jun 5, 2026 13:3164,31632,913,95822,729,0001,068,0002,113,536
3Jun 5, 2026 13:3164,36432,947,88022,684,0001,131,0002,113,536
4Jun 5, 2026 13:3164,39432,956,04622,693,0001,133,0002,113,536
5Jun 5, 2026 13:3164,53732,990,16922,738,0001,141,0002,113,536
6Jun 5, 2026 13:3164,56432,990,07322,757,0001,132,0002,113,536
7Jun 5, 2026 13:3164,65633,004,71022,883,0001,040,0002,113,536
8Jun 5, 2026 13:3164,91833,149,46522,872,0001,148,0002,113,536
9Jun 5, 2026 13:3165,08133,233,08722,914,0001,166,0002,113,536