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 21:47Victor MerckléVictor MerckléScore: 71,548Success
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 21:4871,31635,469,91725,114,0001,273,0002,113,536
2Jun 24, 2026 21:4871,34335,494,60625,122,0001,275,0002,113,536
3Jun 24, 2026 21:4871,52935,599,73225,181,0001,285,0002,113,536
4Jun 24, 2026 21:4871,53235,612,43225,448,0001,019,0002,113,536
5Jun 24, 2026 21:4871,54835,560,79525,252,0001,221,0002,113,536
6Jun 24, 2026 21:4871,74835,684,70225,520,0001,027,0002,113,536
7Jun 24, 2026 21:4871,81035,645,74625,548,0001,022,0002,113,536
8Jun 24, 2026 21:4871,84035,740,41025,560,0001,021,0002,113,536
9Jun 24, 2026 21:4871,85135,863,72325,564,0001,021,0002,113,536