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 10, 2026 13:00Victor MerckléVictor MerckléScore: 62,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 13:0162,31030,457,05123,055,00002,113,536
2Jun 10, 2026 13:0162,48330,532,16823,119,00002,113,536
3Jun 10, 2026 13:0162,55930,470,48323,147,00002,113,536
4Jun 10, 2026 13:0162,58630,543,37423,157,00002,113,536
5Jun 10, 2026 13:0162,72930,587,87123,210,00002,113,536
6Jun 10, 2026 13:0163,05430,730,41223,330,00002,113,536
7Jun 10, 2026 13:0163,10531,334,73123,349,00002,113,536
8Jun 10, 2026 13:0163,10830,772,20923,350,00002,113,536
9Jun 10, 2026 13:0163,52431,251,13023,504,00002,113,536