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 24, 2026 14:18Victor MerckléVictor MerckléScore: 69,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 14:2065,47037,169,41023,200,0001,024,0002,113,536
2Jun 24, 2026 14:2066,63539,079,27823,654,0001,001,0002,113,536
3Jun 24, 2026 14:2067,70238,949,64424,041,0001,009,0002,113,536
4Jun 24, 2026 14:2068,80549,586,52424,381,0001,077,0002,113,536
5Jun 24, 2026 14:2069,90045,516,05624,827,0001,036,0002,113,536
6Jun 24, 2026 14:2070,39741,287,41925,007,0001,040,0002,113,536
7Jun 24, 2026 14:2070,64541,624,15925,134,0001,005,0002,113,536
8Jun 24, 2026 14:2070,66442,209,45525,092,0001,054,0002,113,536
9Jun 24, 2026 14:2071,14543,293,00625,294,0001,030,0002,113,536