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 listJul 8, 2021 19:54Yuriy LyfenkoYuriy LyfenkoScore: 112,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 19:54111,00866,078,24239,070,0002,003,0002,519,040
2Jul 8, 2021 19:54111,10867,825,32138,102,0003,008,0002,334,720
3Jul 8, 2021 19:54111,22467,533,49738,142,0003,011,0002,519,040
4Jul 8, 2021 19:54111,24366,179,26639,153,0002,007,0002,519,040
5Jul 8, 2021 19:54111,41669,028,04439,214,0002,010,0002,334,720
6Jul 8, 2021 19:54111,43863,111,82339,221,0002,011,0002,330,624
7Jul 8, 2021 19:54112,01165,993,97339,423,0002,021,0002,523,136
8Jul 8, 2021 19:54112,10563,481,74639,456,0002,023,0002,527,232
9Jul 8, 2021 19:54112,14664,440,47940,482,0001,012,0002,531,328
10Jul 8, 2021 19:54113,67999,205,66542,061,10002,183,168
11Jul 8, 2021 19:54114,091114,073,61342,213,53802,179,072
12Jul 8, 2021 19:54114,507110,992,50542,367,66402,191,360