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 13, 2021 20:20Yuriy LyfenkoYuriy LyfenkoScore: 88,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 20:2087,511559,125,91131,368,0001,011,0002,306,048
2Jul 13, 2021 20:2087,895556,466,03431,505,0001,016,0002,301,952
3Jul 13, 2021 20:2088,038560,496,06831,557,0001,017,0002,306,048
4Jul 13, 2021 20:2088,549559,709,25730,778,0001,985,0002,306,048
5Jul 13, 2021 20:2088,568565,526,55230,784,0001,986,0002,301,952
6Jul 13, 2021 20:2088,570563,671,65130,785,0001,986,0002,301,952
7Jul 13, 2021 20:2088,705555,192,98329,838,0002,983,0002,482,176
8Jul 13, 2021 20:2089,138558,552,09930,983,0001,998,0002,310,144
9Jul 13, 2021 20:2089,159563,754,69330,990,0001,999,0002,306,048
10Jul 13, 2021 20:2089,504592,341,60733,116,47102,232,320
11Jul 13, 2021 20:2089,540590,615,43233,129,78002,232,320
12Jul 13, 2021 20:2090,352592,797,92433,430,09002,228,224