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:40Victor MerckléVictor MerckléScore: 63,270Success
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:4162,96730,741,66123,298,00002,113,536
2Jun 10, 2026 16:4162,98630,689,20923,305,00002,113,536
3Jun 10, 2026 16:4163,03530,813,31923,323,00002,113,536
4Jun 10, 2026 16:4163,15430,739,11923,367,00002,113,536
5Jun 10, 2026 16:4163,27030,915,82523,410,00002,113,536
6Jun 10, 2026 16:4163,32430,897,90423,430,00002,113,536
7Jun 10, 2026 16:4163,35130,839,28323,440,00002,113,536
8Jun 10, 2026 16:4164,00531,079,07323,682,00002,113,536
9Jun 10, 2026 16:4164,15631,195,53823,738,00002,113,536