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 21:15IlyaIlyaScore: 59,218Success
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 21:1659,00031,322,98120,723,0001,107,0002,113,536
2Jun 30, 2026 21:1659,08331,329,05020,670,0001,191,0002,113,536
3Jun 30, 2026 21:1659,09731,325,63820,690,0001,176,0002,113,536
4Jun 30, 2026 21:1659,13231,417,36420,677,0001,202,0002,113,536
5Jun 30, 2026 21:1659,21831,885,98620,679,0001,232,0002,113,536
6Jun 30, 2026 21:1659,22131,859,73720,716,0001,196,0002,113,536
7Jun 30, 2026 21:1659,22431,857,61720,805,0001,108,0002,113,536
8Jun 30, 2026 21:1659,25131,415,84720,736,0001,187,0002,113,536
9Jun 30, 2026 21:1659,38131,889,37420,787,0001,184,0002,113,536