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 17, 2025 05:10CemaCemaScore: 104,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2025 05:11102,64961,370,15236,981,000999,0002,289,664
2Mar 17, 2025 05:11102,80561,823,55737,037,0001,001,0002,277,376
3Mar 17, 2025 05:11102,87062,881,71536,059,0002,003,0002,289,664
4Mar 17, 2025 05:10104,21963,860,83137,547,0001,014,0002,269,184
5Mar 17, 2025 05:10104,97068,004,20336,848,0001,991,0002,265,088
6Mar 17, 2025 05:10104,97668,840,13336,850,0001,991,0002,289,664
7Mar 17, 2025 05:10106,28173,252,56537,308,0002,016,0002,273,280
8Mar 17, 2025 05:10107,05165,783,90438,594,0001,015,0002,289,664
9Mar 17, 2025 05:10107,71970,333,33237,864,0001,992,0002,289,664