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 18:11IlyaIlyaScore: 60,348Success
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 18:1459,84531,709,31421,036,0001,107,0002,113,536
2Jun 30, 2026 18:1459,97231,681,88321,077,0001,113,0002,113,536
3Jun 30, 2026 18:1459,99131,614,04821,098,0001,099,0002,113,536
4Jun 30, 2026 18:1460,20532,222,61521,081,0001,195,0002,113,536
5Jun 30, 2026 18:1460,34831,759,37321,130,0001,199,0002,113,536
6Jun 30, 2026 18:1460,35631,788,81221,130,0001,202,0002,113,536
7Jun 30, 2026 18:1460,39432,340,71921,147,0001,199,0002,113,536
8Jun 30, 2026 18:1460,42431,891,83321,326,0001,031,0002,113,536
9Jun 30, 2026 18:1460,57032,390,97921,171,0001,240,0002,113,536