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 19, 2026 15:23limanjun99limanjun99Score: 68,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 15:2368,33850,557,66124,274,0001,011,0002,289,664
2Mar 19, 2026 15:2368,36848,155,39823,273,0002,023,0002,387,968
3Mar 19, 2026 15:2368,41448,340,76923,288,0002,025,0002,289,664
4Mar 19, 2026 15:2368,43546,784,54623,296,0002,025,0002,265,088
5Mar 19, 2026 15:2368,50346,744,78323,319,0002,027,0002,289,664
6Mar 19, 2026 15:2368,59245,793,23923,349,0002,030,0002,289,664
7Mar 19, 2026 15:2368,65149,611,48924,385,0001,016,0002,289,664
8Mar 19, 2026 15:2368,83849,111,95025,470,00002,269,184
9Mar 19, 2026 15:2368,85952,246,25923,440,0002,038,0002,289,664