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 10, 2026 15:55Victor MerckléVictor MerckléScore: 63,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 15:5663,20030,790,74622,253,0001,131,0002,113,536
2Jun 10, 2026 15:5663,53730,901,61022,387,0001,122,0002,113,536
3Jun 10, 2026 15:5663,54830,899,86322,368,0001,145,0002,113,536
4Jun 10, 2026 15:5663,74831,326,92222,570,0001,017,0002,113,536
5Jun 10, 2026 15:5663,87830,990,46922,515,0001,120,0002,113,536
6Jun 10, 2026 15:5663,92931,033,02122,506,0001,148,0002,113,536
7Jun 10, 2026 15:5663,94031,035,01822,538,0001,120,0002,113,536
8Jun 10, 2026 15:5663,94831,472,47322,526,0001,135,0002,113,536
9Jun 10, 2026 15:5664,37535,337,37722,688,0001,131,0002,113,536