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 25, 2026 05:43Victor MerckléVictor MerckléScore: 58,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 05:4457,85428,889,37720,389,0001,017,0002,113,536
2Jun 25, 2026 05:4457,87528,877,84920,390,0001,024,0002,113,536
3Jun 25, 2026 05:4457,89728,960,03720,412,0001,010,0002,113,536
4Jun 25, 2026 05:4458,00228,929,21620,460,0001,001,0002,113,536
5Jun 25, 2026 05:4458,01028,905,38020,434,0001,030,0002,113,536
6Jun 25, 2026 05:4458,01628,967,45220,439,0001,027,0002,113,536
7Jun 25, 2026 05:4458,08928,914,18620,480,0001,013,0002,113,536
8Jun 25, 2026 05:4458,12728,960,27720,502,0001,005,0002,113,536
9Jun 25, 2026 05:4458,20029,267,28320,529,0001,005,0002,113,536