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 29, 2026 21:11IlyaIlyaScore: 60,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 21:1260,41831,801,99521,173,0001,182,0002,113,536
2Jun 29, 2026 21:1260,43231,772,86921,225,0001,135,0002,113,536
3Jun 29, 2026 21:1260,45931,826,49321,144,0001,226,0002,113,536
4Jun 29, 2026 21:1260,48931,830,16921,194,0001,187,0002,113,536
5Jun 29, 2026 21:1260,48931,874,30721,189,0001,192,0002,113,536
6Jun 29, 2026 21:1260,63531,950,95221,260,0001,175,0002,113,536
7Jun 29, 2026 21:1260,68632,414,33521,249,0001,205,0002,113,536
8Jun 29, 2026 21:1260,72433,766,30321,222,0001,246,0002,113,536
9Jun 29, 2026 21:1260,73531,969,13621,262,0001,210,0002,113,536