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 12, 2021 22:00piculpiculScore: 113,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2021 22:00108,55161,682,88438,156,0002,008,0002,433,024
2Sep 12, 2021 22:00109,64669,833,00339,555,0001,014,0002,457,600
3Sep 12, 2021 22:00110,34671,444,63838,837,0001,991,0002,441,216
4Sep 12, 2021 22:00110,56865,696,40038,915,0001,995,0002,469,888
5Sep 12, 2021 22:00111,41165,469,50839,212,0002,010,0002,437,120
6Sep 12, 2021 22:00112,43271,663,86141,600,00002,469,888
7Sep 12, 2021 22:00113,00572,222,52839,821,0001,991,0002,482,176
8Sep 12, 2021 22:00113,88667,744,91242,138,00002,433,024
9Sep 12, 2021 22:00114,59564,935,13141,391,0001,009,0002,473,984
10Sep 12, 2021 22:00118,927119,886,26944,002,89502,297,856
11Sep 12, 2021 22:00120,887108,595,62944,728,19302,285,568
12Sep 12, 2021 22:00123,800108,458,35145,806,01802,285,568