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 01:05Victor MerckléVictor MerckléScore: 60,413Success
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 01:0660,25429,748,90321,266,0001,028,0002,113,536
2Jun 25, 2026 01:0660,25429,757,12421,265,0001,029,0002,113,536
3Jun 25, 2026 01:0660,32129,755,22121,283,0001,036,0002,113,536
4Jun 25, 2026 01:0660,37829,789,00322,340,00002,113,536
5Jun 25, 2026 01:0660,41329,831,54221,330,0001,023,0002,113,536
6Jun 25, 2026 01:0660,45929,801,96821,364,0001,006,0002,113,536
7Jun 25, 2026 01:0660,48129,865,45521,370,0001,008,0002,113,536
8Jun 25, 2026 01:0660,55429,827,87521,368,0001,037,0002,113,536
9Jun 25, 2026 01:0660,68929,899,45221,453,0001,002,0002,113,536