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 18, 2026 16:02Victor MerckléVictor MerckléScore: 63,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 16:0362,86730,687,39523,261,00002,113,536
2Jun 18, 2026 16:0363,00230,760,68023,311,00002,113,536
3Jun 18, 2026 16:0363,18130,776,52723,377,00002,113,536
4Jun 18, 2026 16:0363,33731,054,89723,435,00002,113,536
5Jun 18, 2026 16:0363,37030,840,58623,447,00002,113,536
6Jun 18, 2026 16:0363,51830,871,52523,502,00002,113,536
7Jun 18, 2026 16:0363,54031,511,04823,510,00002,113,536
8Jun 18, 2026 16:0363,78131,383,67023,599,00002,113,536
9Jun 18, 2026 16:0363,81831,553,35023,613,00002,113,536