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 18, 2026 16:40Victor MerckléVictor MerckléScore: 66,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 16:4165,74831,842,72524,327,00002,113,536
2Jun 18, 2026 16:4165,83531,762,54924,359,00002,113,536
3Jun 18, 2026 16:4166,02731,856,51624,430,00002,113,536
4Jun 18, 2026 16:4166,04331,978,18924,436,00002,113,536
5Jun 18, 2026 16:4166,34332,067,11124,547,00002,113,536
6Jun 18, 2026 16:4166,54532,224,35723,605,0001,017,0002,113,536
7Jun 18, 2026 16:4166,57832,517,81724,634,00002,113,536
8Jun 18, 2026 16:4166,82732,790,32724,726,00002,113,536
9Jun 18, 2026 16:4167,31032,677,29424,905,00002,113,536