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 25, 2026 05:50Victor MerckléVictor MerckléScore: 57,459Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 05:5157,22928,813,53120,157,0001,018,0002,113,536
2Jun 25, 2026 05:5157,27528,849,45020,162,0001,030,0002,113,536
3Jun 25, 2026 05:5157,41328,766,11620,240,0001,003,0002,113,536
4Jun 25, 2026 05:5157,44828,695,08620,221,0001,035,0002,113,536
5Jun 25, 2026 05:5157,45928,915,42620,256,0001,004,0002,113,536
6Jun 25, 2026 05:5157,46228,763,60220,226,0001,035,0002,113,536
7Jun 25, 2026 05:5157,51829,103,73620,245,0001,037,0002,113,536
8Jun 25, 2026 05:5157,55428,867,29720,259,0001,036,0002,113,536
9Jun 25, 2026 05:5157,57028,827,45320,299,0001,002,0002,113,536