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 14, 2021 14:11Yuriy LyfenkoYuriy LyfenkoScore: 87,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 14:1186,784558,343,16929,100,0003,010,0002,510,848
2Jul 14, 2021 14:1187,108558,983,01130,216,0002,014,0002,330,624
3Jul 14, 2021 14:1187,154558,436,64029,224,0003,023,0002,510,848
4Jul 14, 2021 14:1187,308559,372,51730,285,0002,019,0002,326,528
5Jul 14, 2021 14:1187,357552,408,73030,302,0002,020,0002,330,624
6Jul 14, 2021 14:1187,359559,897,04130,303,0002,020,0002,498,560
7Jul 14, 2021 14:1187,405558,539,60331,330,0001,010,0002,330,624
8Jul 14, 2021 14:1187,605557,957,18731,402,0001,012,0002,510,848
9Jul 14, 2021 14:1187,912598,041,48632,527,29402,252,800
10Jul 14, 2021 14:1188,046595,390,78932,577,13102,248,704
11Jul 14, 2021 14:1188,154560,796,15530,579,0002,038,0002,498,560
12Jul 14, 2021 14:1188,944586,927,23332,909,22602,252,800