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 19:49Victor MerckléVictor MerckléScore: 70,729Success
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 19:5070,49735,169,90724,803,0001,281,0002,113,536
2Jun 24, 2026 19:5070,52935,208,96525,076,0001,020,0002,113,536
3Jun 24, 2026 19:5070,64535,219,18525,122,0001,017,0002,113,536
4Jun 24, 2026 19:5070,64535,282,72825,118,0001,021,0002,113,536
5Jun 24, 2026 19:5070,72935,330,58124,891,0001,279,0002,113,536
6Jun 24, 2026 19:5070,74335,249,92124,887,0001,288,0002,113,536
7Jun 24, 2026 19:5070,95436,777,27125,232,0001,021,0002,113,536
8Jun 24, 2026 19:5070,97835,352,79724,969,0001,293,0002,117,632
9Jun 24, 2026 19:5070,99435,381,80025,246,0001,022,0002,113,536