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 25, 2026 05:21Victor MerckléVictor MerckléScore: 57,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 05:2257,64528,951,17720,319,0001,010,0002,113,536
2Jun 25, 2026 05:2257,65428,813,21320,329,0001,003,0002,113,536
3Jun 25, 2026 05:2257,66728,780,18920,309,0001,028,0002,113,536
4Jun 25, 2026 05:2257,81629,291,22620,387,0001,005,0002,113,536
5Jun 25, 2026 05:2257,86728,897,85720,383,0001,028,0002,113,536
6Jun 25, 2026 05:2257,90528,863,91520,395,0001,030,0002,113,536
7Jun 25, 2026 05:2257,92129,347,50120,401,0001,030,0002,113,536
8Jun 25, 2026 05:2258,19429,008,44620,514,0001,018,0002,113,536
9Jun 25, 2026 05:2258,89729,276,17421,792,00002,113,536