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 22:20IlyaIlyaScore: 60,140Success
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 22:2159,75931,524,98521,004,0001,107,0002,113,536
2Jun 30, 2026 22:2159,90031,726,23821,060,0001,103,0002,113,536
3Jun 30, 2026 22:2159,99731,661,29121,027,0001,172,0002,113,536
4Jun 30, 2026 22:2160,09431,804,17921,039,0001,196,0002,113,536
5Jun 30, 2026 22:2160,14031,764,06221,077,0001,175,0002,113,536
6Jun 30, 2026 22:2160,14531,745,34821,095,0001,159,0002,113,536
7Jun 30, 2026 22:2160,31631,832,76421,110,0001,207,0002,113,536
8Jun 30, 2026 22:2160,39732,115,69921,177,0001,170,0002,113,536
9Jun 30, 2026 22:2121,422,0627,936,246,9807,770,316,000155,847,0002,113,536