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 17:48piculpiculScore: 73,897Success
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 17:4873,38949,399,38425,143,0002,011,0002,289,664
2Sep 15, 2021 17:4873,43849,266,47125,160,0002,012,0002,289,664
3Sep 15, 2021 17:4873,52249,558,29925,188,0002,015,0002,289,664
4Sep 15, 2021 17:4873,56257,704,62626,210,0001,008,0002,289,664
5Sep 15, 2021 17:4873,63254,191,05526,235,0001,009,0002,289,664
6Sep 15, 2021 17:4873,87048,701,93826,320,0001,012,0002,269,184
7Sep 15, 2021 17:4873,89749,939,09725,317,0002,025,0002,289,664
8Sep 15, 2021 17:4874,00055,527,91325,352,0002,028,0002,277,376
9Sep 15, 2021 17:4874,08155,414,22126,395,0001,015,0002,289,664
10Sep 15, 2021 17:4875,33883,835,09327,875,10902,256,896
11Sep 15, 2021 17:4875,61291,354,19027,976,59902,269,184
12Sep 15, 2021 17:4875,92785,231,43528,092,96602,265,088