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 13:35Victor MerckléVictor MerckléScore: 63,970Success
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 13:3663,10832,370,82122,227,0001,123,0002,117,632stderr
2Jun 10, 2026 13:3663,14532,397,45122,247,0001,117,0002,117,632stderr
3Jun 10, 2026 13:3663,35932,379,14722,409,0001,034,0002,117,632stderr
4Jun 10, 2026 13:3663,78633,633,54022,448,0001,153,0002,117,632stderr
5Jun 10, 2026 13:3663,97033,137,83522,556,0001,113,0002,117,632stderr
6Jun 10, 2026 13:3664,01832,776,57722,583,0001,104,0002,117,632stderr
7Jun 10, 2026 13:3664,31832,810,94922,675,0001,123,0002,117,632stderr
8Jun 10, 2026 13:3664,68133,006,81822,799,0001,133,0002,117,632stderr
9Jun 10, 2026 13:36165,76770,385,26560,191,0001,143,0002,117,632stderr