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 05:34Victor MerckléVictor MerckléScore: 63,327Success
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 05:3562,51630,510,64823,131,00002,113,536
2Jun 18, 2026 05:3563,01030,710,90323,314,00002,113,536
3Jun 18, 2026 05:3563,21030,898,61823,388,00002,113,536
4Jun 18, 2026 05:3563,28130,903,91323,414,00002,113,536
5Jun 18, 2026 05:3563,32730,865,36223,431,00002,113,536
6Jun 18, 2026 05:3563,37230,890,30123,448,00002,113,536
7Jun 18, 2026 05:3563,47231,509,83323,485,00002,113,536
8Jun 18, 2026 05:3563,89131,696,17723,640,00002,113,536
9Jun 18, 2026 05:3564,22931,156,55622,588,0001,177,0002,113,536