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 24, 2026 17:37Victor MerckléVictor MerckléScore: 63,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 17:3863,00230,791,12923,311,00002,113,536
2Jun 24, 2026 17:3863,00530,792,17023,312,00002,113,536
3Jun 24, 2026 17:3863,03230,745,05623,322,00002,113,536
4Jun 24, 2026 17:3863,63731,212,71723,546,00002,113,536
5Jun 24, 2026 17:3863,63731,013,94623,546,00002,113,536
6Jun 24, 2026 17:3863,65631,007,54723,553,00002,113,536
7Jun 24, 2026 17:3863,76230,976,72123,592,00002,113,536
8Jun 24, 2026 17:3863,94831,146,33723,661,00002,113,536
9Jun 24, 2026 17:3864,11031,167,85023,721,00002,113,536