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 listJan 29, 2024 14:10AnSaAnSaScore: 153,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2024 14:10113,006102,333,18041,812,34202,269,184
2Jan 29, 2024 14:10113,282103,147,98741,914,20802,260,992
3Jan 29, 2024 14:10114,336113,108,94542,304,14802,252,800
4Jan 29, 2024 14:10152,67879,448,13848,421,0008,070,0002,273,280
5Jan 29, 2024 14:10152,93285,049,36045,470,00011,115,0002,269,184
6Jan 29, 2024 14:10153,45782,526,93444,826,00011,953,0002,359,296
7Jan 29, 2024 14:10153,49579,477,86441,848,00014,945,0002,347,008
8Jan 29, 2024 14:10153,71680,572,52442,906,00013,969,0002,330,624
9Jan 29, 2024 14:10154,25484,599,87836,047,00021,027,0002,281,472
10Jan 29, 2024 14:10154,47880,286,07043,119,00014,038,0002,318,336
11Jan 29, 2024 14:10154,69781,616,77838,159,00019,079,0002,330,624
12Jan 29, 2024 14:10209,05499,749,32663,287,00014,063,0002,314,240