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 30, 2026 10:48IlyaIlyaScore: 60,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 10:4960,56731,906,54921,296,0001,114,0002,113,536
2Jun 30, 2026 10:4960,80231,967,64021,301,0001,196,0002,113,536
3Jun 30, 2026 10:4960,84032,402,23421,299,0001,212,0002,113,536
4Jun 30, 2026 10:4960,84832,484,71521,317,0001,197,0002,113,536
5Jun 30, 2026 10:4960,93732,070,83421,398,0001,149,0002,113,536
6Jun 30, 2026 10:4961,01832,040,92021,390,0001,187,0002,113,536
7Jun 30, 2026 10:4961,12732,552,15321,395,0001,222,0002,113,536
8Jun 30, 2026 10:4961,27832,687,86721,633,0001,040,0002,113,536
9Jun 30, 2026 10:4962,76740,242,09422,063,0001,161,0002,113,536