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 18:02Victor MerckléVictor MerckléScore: 73,843Success
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 18:0373,67836,378,47226,149,0001,112,0002,113,536
2Jun 24, 2026 18:0373,70236,398,01726,164,0001,106,0002,113,536
3Jun 24, 2026 18:0373,76736,425,96826,270,0001,024,0002,113,536
4Jun 24, 2026 18:0373,79136,357,45926,196,0001,107,0002,113,536
5Jun 24, 2026 18:0373,84336,414,31526,216,0001,106,0002,113,536
6Jun 24, 2026 18:0373,84536,488,41226,300,0001,023,0002,113,536
7Jun 24, 2026 18:0373,85136,383,69026,215,0001,110,0002,113,536
8Jun 24, 2026 18:0373,87836,386,36626,311,0001,024,0002,113,536
9Jun 24, 2026 18:0373,88636,435,28326,310,0001,028,0002,113,536