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 23:38Victor MerckléVictor MerckléScore: 58,902Success
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 23:3958,71329,142,73521,724,00002,113,536
2Jun 24, 2026 23:3958,76229,395,53020,737,0001,005,0002,113,536
3Jun 24, 2026 23:3958,77029,337,49220,708,0001,037,0002,113,536
4Jun 24, 2026 23:3958,80529,440,02920,736,0001,022,0002,113,536
5Jun 24, 2026 23:3958,90229,290,25620,756,0001,038,0002,113,536
6Jun 24, 2026 23:3958,97229,913,04720,814,0001,006,0002,113,536
7Jun 24, 2026 23:3959,00229,278,09020,822,0001,009,0002,113,536
8Jun 24, 2026 23:3959,05129,253,24920,812,0001,037,0002,113,536
9Jun 24, 2026 23:3959,07529,603,78320,854,0001,004,0002,113,536