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 6, 2026 10:19Victor MerckléVictor MerckléScore: 68,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 10:2068,15436,790,60624,082,0001,135,0002,113,536
2Jun 6, 2026 10:2068,18334,347,19524,087,0001,141,0002,113,536
3Jun 6, 2026 10:2068,20534,293,41624,095,0001,141,0002,113,536
4Jun 6, 2026 10:2068,36434,414,64624,154,0001,141,0002,113,536
5Jun 6, 2026 10:2068,36434,336,91424,160,0001,135,0002,113,536
6Jun 6, 2026 10:2068,45134,441,13624,166,0001,161,0002,113,536
7Jun 6, 2026 10:2068,67234,476,59524,266,0001,143,0002,113,536
8Jun 6, 2026 10:2068,70834,528,28724,283,0001,139,0002,113,536
9Jun 6, 2026 10:2068,74534,502,64024,283,0001,153,0002,113,536