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 05:39Victor MerckléVictor MerckléScore: 63,245Success
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 05:4062,63730,738,54723,176,00002,113,536
2Jun 18, 2026 05:4062,91630,876,26823,279,00002,113,536
3Jun 18, 2026 05:4063,04531,127,30823,327,00002,113,536
4Jun 18, 2026 05:4063,19130,980,58023,381,00002,113,536
5Jun 18, 2026 05:4063,24531,312,40923,401,00002,113,536
6Jun 18, 2026 05:4063,24531,075,88523,401,00002,113,536
7Jun 18, 2026 05:4063,51032,205,59623,499,00002,113,536
8Jun 18, 2026 05:4063,87531,235,16423,634,00002,113,536
9Jun 18, 2026 05:4063,88931,290,38623,639,00002,113,536