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 10, 2026 16:10Victor MerckléVictor MerckléScore: 64,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 16:1164,27831,138,37922,664,0001,119,0002,113,536
2Jun 10, 2026 16:1164,38332,106,85822,699,0001,123,0002,113,536
3Jun 10, 2026 16:1164,42131,240,11422,736,0001,100,0002,113,536
4Jun 10, 2026 16:1164,68931,349,95722,805,0001,130,0002,113,536
5Jun 10, 2026 16:1164,87231,925,67622,878,0001,125,0002,113,536
6Jun 10, 2026 16:1165,09731,494,15522,959,0001,127,0002,113,536
7Jun 10, 2026 16:1165,10531,503,61422,970,0001,119,0002,113,536
8Jun 10, 2026 16:1165,12431,537,14323,070,0001,026,0002,113,536
9Jun 10, 2026 16:1165,42931,789,58623,094,0001,115,0002,113,536