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 listMar 5, 2026 01:35olliecrowolliecrowScore: 69,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2026 01:3569,26550,598,69424,603,0001,025,0002,404,352
2Mar 5, 2026 01:3569,81951,973,54625,833,00002,285,568
3Mar 5, 2026 01:3569,84352,443,88723,855,0001,987,0002,285,568
4Mar 5, 2026 01:3569,87057,622,61525,852,00002,408,448
5Mar 5, 2026 01:3569,88460,306,88225,857,00002,400,256
6Mar 5, 2026 01:3569,95753,201,38624,889,000995,0002,400,256
7Mar 5, 2026 01:3570,08449,222,46824,934,000997,0002,404,352
8Mar 5, 2026 01:3570,17852,113,90823,969,0001,997,0002,285,568
9Mar 5, 2026 01:3570,21448,817,07924,980,000999,0002,285,568