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 15, 2021 20:10piculpiculScore: 72,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 20:1071,81654,014,22926,572,00002,289,664
2Sep 15, 2021 20:1071,84648,421,30726,583,00002,265,088
3Sep 15, 2021 20:1071,93254,121,70525,592,0001,023,0002,273,280
4Sep 15, 2021 20:1071,94352,506,36825,596,0001,023,0002,289,664
5Sep 15, 2021 20:1072,04354,000,64526,656,00002,289,664
6Sep 15, 2021 20:1072,05453,579,84125,635,0001,025,0002,289,664
7Sep 15, 2021 20:1072,14359,748,22425,667,0001,026,0002,289,664
8Sep 15, 2021 20:1072,46854,469,42125,820,000993,0002,265,088
9Sep 15, 2021 20:1072,50355,992,93025,833,000993,0002,273,280
10Sep 15, 2021 20:1075,05685,681,30227,770,86402,277,376
11Sep 15, 2021 20:1075,493100,918,48127,932,25902,269,184
12Sep 15, 2021 20:1075,565107,029,52727,959,01002,265,088