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 17:20Yuriy LyfenkoYuriy LyfenkoScore: 101,122Success
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 17:2099,63061,631,17634,871,0001,992,0002,519,040
2Jul 13, 2021 17:2099,67868,902,20834,888,0001,993,0002,334,720
3Jul 13, 2021 17:2099,96262,154,08034,987,0001,999,0002,519,040
4Jul 13, 2021 17:20100,07865,893,12735,028,0002,001,0002,289,664
5Jul 13, 2021 17:20100,08962,823,40834,031,0003,002,0002,519,040
6Jul 13, 2021 17:20100,13263,588,51035,047,0002,002,0002,334,720
7Jul 13, 2021 17:20101,12265,041,36036,404,0001,011,0002,519,040
8Jul 13, 2021 17:20101,17857,570,77835,413,0002,023,0002,342,912
9Jul 13, 2021 17:20101,33861,986,37936,482,0001,013,0002,527,232
10Jul 13, 2021 17:20102,324111,599,20337,859,77302,187,264
11Jul 13, 2021 17:20102,705101,983,01538,000,67002,191,360
12Jul 13, 2021 17:20103,602100,716,77338,332,71102,191,360