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:23Victor MerckléVictor MerckléScore: 62,913Success
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:2462,50231,101,80623,126,00002,113,536
2Jun 18, 2026 05:2462,52430,743,61523,134,00002,113,536
3Jun 18, 2026 05:2462,66430,843,03723,186,00002,113,536
4Jun 18, 2026 05:2462,83730,893,26723,250,00002,113,536
5Jun 18, 2026 05:2462,91330,872,90323,278,00002,113,536
6Jun 18, 2026 05:2463,04830,950,33823,328,00002,113,536
7Jun 18, 2026 05:2463,17530,825,09823,375,00002,113,536
8Jun 18, 2026 05:2463,37030,840,15023,447,00002,113,536
9Jun 18, 2026 05:2463,46431,187,47523,482,00002,113,536