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 07:28IlyaIlyaScore: 59,032Success
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 07:2958,72931,145,86520,621,0001,109,0002,113,536
2Jun 30, 2026 07:2958,82931,251,82420,662,0001,105,0002,113,536
3Jun 30, 2026 07:2958,85631,203,80520,680,0001,097,0002,113,536
4Jun 30, 2026 07:2958,92932,067,89420,609,0001,195,0002,113,536
5Jun 30, 2026 07:2959,03231,251,72020,669,0001,173,0002,113,536
6Jun 30, 2026 07:2959,08331,763,18020,674,0001,187,0002,113,536
7Jun 30, 2026 07:2959,13731,320,40320,709,0001,172,0002,113,536
8Jun 30, 2026 07:2959,14331,313,86720,688,0001,195,0002,113,536
9Jun 30, 2026 07:2959,49731,999,84520,802,0001,212,0002,113,536