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 listJul 1, 2026 14:25IlyaIlyaScore: 59,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 14:2658,79431,177,25420,619,0001,135,0002,113,536
2Jul 1, 2026 14:2658,89731,218,28920,684,0001,108,0002,113,536
3Jul 1, 2026 14:2658,95131,403,18720,639,0001,173,0002,113,536
4Jul 1, 2026 14:2658,97231,286,62220,710,0001,110,0002,113,536
5Jul 1, 2026 14:2659,07031,424,16220,666,0001,190,0002,113,536
6Jul 1, 2026 14:2659,09431,890,34720,665,0001,200,0002,113,536
7Jul 1, 2026 14:2659,23731,443,20120,719,0001,199,0002,113,536
8Jul 1, 2026 14:2659,37231,974,61220,712,0001,256,0002,113,536
9Jul 1, 2026 14:2659,51631,950,08820,808,0001,213,0002,113,536