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 listNov 1, 2021 10:48Ilya AniskovetsIlya AniskovetsScore: 119,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2021 10:48118,51172,910,44342,853,000996,0002,289,664
2Nov 1, 2021 10:48118,64166,202,13641,902,0001,995,0002,269,184
3Nov 1, 2021 10:48118,75477,392,57441,942,0001,997,0002,289,664
4Nov 1, 2021 10:48118,82467,019,41741,967,0001,998,0002,289,664
5Nov 1, 2021 10:48119,01170,827,16342,033,0002,001,0002,289,664
6Nov 1, 2021 10:48119,01667,517,34543,036,0001,000,0002,277,376
7Nov 1, 2021 10:48119,05166,858,21142,047,0002,002,0002,273,280
8Nov 1, 2021 10:48119,13268,626,55642,076,0002,003,0002,527,232
9Nov 1, 2021 10:48119,32468,167,02242,144,0002,006,0002,289,664
10Nov 1, 2021 10:48121,28599,635,44044,875,36202,260,992
11Nov 1, 2021 10:48122,147104,964,39945,194,26902,269,184
12Nov 1, 2021 10:48122,485108,498,05945,319,49802,269,184