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 06:58Victor MerckléVictor MerckléScore: 57,297Success
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 06:5957,20028,615,32821,164,00002,113,536
2Jun 25, 2026 06:5957,22428,668,65120,163,0001,010,0002,113,536
3Jun 25, 2026 06:5957,26729,133,90520,171,0001,018,0002,113,536
4Jun 25, 2026 06:5957,28128,674,39621,194,00002,113,536
5Jun 25, 2026 06:5957,29729,795,88220,155,0001,045,0002,113,536
6Jun 25, 2026 06:5957,37828,753,53220,203,0001,027,0002,113,536
7Jun 25, 2026 06:5957,47029,058,44820,217,0001,047,0002,113,536
8Jun 25, 2026 06:5957,54028,750,75720,262,0001,028,0002,113,536
9Jun 25, 2026 06:5957,58128,801,48320,295,0001,010,0002,113,536