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 21:52Victor MerckléVictor MerckléScore: 71,200Success
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 21:5371,08135,405,50325,047,0001,253,0002,113,536
2Jun 24, 2026 21:5371,09435,444,94525,052,0001,253,0002,113,536
3Jun 24, 2026 21:5371,12435,460,15525,072,0001,244,0002,113,536
4Jun 24, 2026 21:5371,13235,385,35025,050,0001,269,0002,113,536
5Jun 24, 2026 21:5371,20035,493,23625,094,0001,250,0002,113,536
6Jun 24, 2026 21:5371,21336,633,80025,066,0001,283,0002,113,536
7Jun 24, 2026 21:5371,44335,554,91625,177,0001,257,0002,113,536
8Jun 24, 2026 21:5371,45935,567,43625,152,0001,288,0002,113,536
9Jun 24, 2026 21:5371,52135,566,58525,175,0001,288,0002,113,536