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 13:47Victor MerckléVictor MerckléScore: 63,100Success
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 13:4862,49730,583,11823,124,00002,113,536
2Jun 24, 2026 13:4862,81330,677,75722,225,0001,016,0002,113,536
3Jun 24, 2026 13:4862,97230,732,28822,268,0001,032,0002,113,536
4Jun 24, 2026 13:4862,97830,751,17522,291,0001,011,0002,113,536
5Jun 24, 2026 13:4863,10030,780,98122,316,0001,031,0002,113,536
6Jun 24, 2026 13:4863,26230,871,50122,378,0001,029,0002,113,536
7Jun 24, 2026 13:4863,47530,999,20822,438,0001,048,0002,113,536
8Jun 24, 2026 13:4864,69738,561,48722,918,0001,020,0002,113,536
9Jun 24, 2026 13:48623,113238,007,866229,522,0001,030,0002,113,536