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 19, 2026 08:29Victor MerckléVictor MerckléScore: 63,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 08:3062,76230,633,94023,222,00002,113,536
2Jun 19, 2026 08:3062,82730,648,64523,246,00002,113,536
3Jun 19, 2026 08:3063,23230,789,18623,396,00002,113,536
4Jun 19, 2026 08:3063,35131,077,26223,440,00002,113,536
5Jun 19, 2026 08:3063,45430,889,25723,478,00002,113,536
6Jun 19, 2026 08:3063,59131,231,23423,529,00002,113,536
7Jun 19, 2026 08:3063,82731,235,97123,616,00002,113,536
8Jun 19, 2026 08:3063,95631,648,92323,664,00002,113,536
9Jun 19, 2026 08:3064,04831,605,25323,698,00002,113,536