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 13:09Charles CabergsCharles CabergsScore: 70,889Success
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 13:0970,71848,033,81025,160,0001,006,0002,363,392
2Apr 26, 2026 13:0970,81641,636,51124,187,0002,015,0002,355,200
3Apr 26, 2026 13:0970,85145,152,06824,199,0002,016,0002,416,640
4Apr 26, 2026 13:0970,85945,138,00125,210,0001,008,0002,310,144
5Apr 26, 2026 13:0970,88943,237,22224,212,0002,017,0002,355,200
6Apr 26, 2026 13:0970,98939,199,44025,256,0001,010,0002,306,048
7Apr 26, 2026 13:0971,05641,483,10425,280,0001,011,0002,359,296
8Apr 26, 2026 13:0971,06444,047,02225,283,0001,011,0002,363,392
9Apr 26, 2026 13:0971,17241,721,14424,309,0002,025,0002,310,144