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 7, 2026 02:32Victor MerckléVictor MerckléScore: 64,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 02:3463,74332,692,21122,518,0001,067,0002,113,536
2Jun 7, 2026 02:3463,84332,697,84522,494,0001,128,0002,113,536
3Jun 7, 2026 02:3463,95932,781,12922,540,0001,125,0002,113,536
4Jun 7, 2026 02:3463,99432,819,94522,554,0001,124,0002,113,536
5Jun 7, 2026 02:3464,08132,784,73522,576,0001,134,0002,113,536
6Jun 7, 2026 02:3464,08632,837,21822,567,0001,145,0002,113,536
7Jun 7, 2026 02:3464,28632,907,88122,718,0001,068,0002,113,536
8Jun 7, 2026 02:3464,47233,007,93722,710,0001,145,0002,113,536
9Jun 7, 2026 02:3464,70833,155,88022,929,0001,013,0002,113,536