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 listApr 26, 2026 17:14Charles CabergsCharles CabergsScore: 71,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 17:1571,39740,555,77225,401,0001,016,0002,359,296
2Apr 26, 2026 17:1571,61343,783,23125,478,0001,019,0002,359,296
3Apr 26, 2026 17:1571,65443,235,35425,493,0001,019,0002,363,392
4Apr 26, 2026 17:1571,65442,035,66025,493,0001,019,0002,347,008
5Apr 26, 2026 17:1571,70844,674,28725,512,0001,020,0002,355,200
6Apr 26, 2026 17:1571,74342,912,72824,579,0001,966,0002,363,392
7Apr 26, 2026 17:1571,77846,150,01125,537,0001,021,0002,363,392
8Apr 26, 2026 17:1571,87247,485,08925,571,0001,022,0002,355,200
9Apr 26, 2026 17:1571,92941,492,40625,591,0001,023,0002,437,120