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 listMay 11, 2026 15:43Victor MerckléVictor MerckléScore: 68,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:4468,82434,855,10924,177,0001,288,0002,113,536
2May 11, 2026 15:4468,83234,667,66924,229,0001,239,0002,113,536
3May 11, 2026 15:4468,86436,088,83024,202,0001,278,0002,113,536
4May 11, 2026 15:4468,91034,413,19624,210,0001,287,0002,113,536
5May 11, 2026 15:4468,97536,369,15224,273,0001,248,0002,113,536
6May 11, 2026 15:4469,35134,428,04424,378,0001,282,0002,113,536
7May 11, 2026 15:4469,42734,435,22724,378,0001,310,0002,113,536
8May 11, 2026 15:4469,43235,664,42324,662,0001,028,0002,113,536
9May 11, 2026 15:4469,68337,413,28224,722,0001,061,0002,113,536