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 12:27Victor MerckléVictor MerckléScore: 67,110Success
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 12:2866,35133,532,09423,542,0001,008,0002,117,632stderr
2Jun 10, 2026 12:2866,80233,711,58323,701,0001,016,0002,117,632stderr
3Jun 10, 2026 12:2866,92933,819,87423,746,0001,018,0002,117,632stderr
4Jun 10, 2026 12:2866,94033,793,81023,738,0001,030,0002,117,632stderr
5Jun 10, 2026 12:2867,11034,140,87923,741,0001,090,0002,117,632stderr
6Jun 10, 2026 12:2867,52133,952,27323,956,0001,027,0002,117,632stderr
7Jun 10, 2026 12:2867,53734,034,65723,981,0001,008,0002,117,632stderr
8Jun 10, 2026 12:2867,72134,437,45924,040,0001,017,0002,117,632stderr
9Jun 10, 2026 12:2867,73734,077,32124,035,0001,028,0002,117,632stderr