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 listSep 16, 2021 10:04Mikhail ShirokovMikhail ShirokovScore: 106,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2021 10:04105,38976,111,75637,995,000999,0002,519,040
2Sep 16, 2021 10:04105,60865,776,02738,074,0001,001,0002,396,160
3Sep 16, 2021 10:04105,65167,514,01138,089,0001,002,0002,519,040
4Sep 16, 2021 10:04105,67068,275,20338,096,0001,002,0002,375,680
5Sep 16, 2021 10:04105,81464,649,28038,148,0001,003,0002,383,872
6Sep 16, 2021 10:04105,88463,382,53238,173,0001,004,0002,392,064
7Sep 16, 2021 10:04106,13269,157,32437,256,0002,013,0002,519,040
8Sep 16, 2021 10:04106,41160,974,88937,353,0002,019,0002,387,968
9Sep 16, 2021 10:04107,69268,416,39739,846,00002,519,040
10Sep 16, 2021 10:04108,854115,509,44740,275,99702,256,896
11Sep 16, 2021 10:04109,355112,984,40440,461,18602,244,608
12Sep 16, 2021 10:04109,991107,804,68740,696,50802,203,648