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 20:01Yurkov AlekseyYurkov AlekseyScore: 105,024Success
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 20:01104,08959,446,44237,500,0001,013,0002,273,280
2Jul 8, 2021 20:01104,38467,821,39737,606,0001,016,0002,277,376
3Jul 8, 2021 20:01104,55970,074,66737,669,0001,018,0002,289,664
4Jul 8, 2021 20:01104,59265,111,93038,699,00002,289,664
5Jul 8, 2021 20:01104,85164,564,70136,806,0001,989,0002,289,664
6Jul 8, 2021 20:01104,97666,540,57037,846,000995,0002,289,664
7Jul 8, 2021 20:01105,02473,453,42136,867,0001,992,0002,289,664
8Jul 8, 2021 20:01105,39561,418,18536,997,0001,999,0002,289,664
9Jul 8, 2021 20:01106,01961,887,52737,216,0002,011,0002,273,280
10Jul 8, 2021 20:01133,853101,531,82949,525,68202,265,088
11Jul 8, 2021 20:01134,085110,663,35649,611,32802,260,992
12Jul 8, 2021 20:01134,336107,288,39649,704,38202,269,184