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 4, 2026 23:20olliecrowolliecrowScore: 68,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 23:2168,17243,408,75824,038,0001,186,0002,363,392
2May 4, 2026 23:2168,23742,118,82324,063,0001,185,0002,379,776
3May 4, 2026 23:2168,27241,818,83924,076,0001,185,0002,363,392
4May 4, 2026 23:2168,34343,888,50224,093,0001,194,0002,367,488
5May 4, 2026 23:2168,43743,453,61124,132,0001,190,0002,375,680
6May 4, 2026 23:2168,59741,582,40224,210,0001,171,0002,371,584
7May 4, 2026 23:2168,71642,007,00824,245,0001,180,0002,375,680
8May 4, 2026 23:2168,71842,235,79224,229,0001,197,0002,355,200
9May 4, 2026 23:2172,85943,370,25025,759,0001,199,0002,367,488