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:05IlyaIlyaScore: 59,329Success
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:0659,02431,353,12520,712,0001,127,0002,113,536
2Jun 29, 2026 21:0659,12131,348,88220,769,0001,106,0002,113,536
3Jun 29, 2026 21:0659,23731,411,47920,735,0001,183,0002,113,536
4Jun 29, 2026 21:0659,29731,855,92920,814,0001,126,0002,113,536
5Jun 29, 2026 21:0659,32931,825,11920,754,0001,198,0002,113,536
6Jun 29, 2026 21:0659,34833,240,50420,734,0001,225,0002,113,536
7Jun 29, 2026 21:0659,39731,465,06620,795,0001,182,0002,113,536
8Jun 29, 2026 21:0659,42431,844,27120,800,0001,187,0002,113,536
9Jun 29, 2026 21:0659,52731,980,38620,810,0001,215,0002,113,536