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 listAug 6, 2022 21:57Franek KortaFranek KortaScore: 76,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 21:5776,57857,164,58024,287,0004,047,0002,330,624
2Aug 6, 2022 21:5776,61159,525,94926,322,0002,024,0002,318,336
3Aug 6, 2022 21:5776,81957,544,71427,408,0001,015,0002,318,336
4Aug 6, 2022 21:5776,83253,759,43227,413,0001,015,0002,330,624
5Aug 6, 2022 21:5776,83859,058,58528,430,00002,347,008
6Aug 6, 2022 21:5776,91453,833,44425,409,0003,049,0002,338,816
7Aug 6, 2022 21:5776,94154,257,84426,435,0002,033,0002,342,912
8Aug 6, 2022 21:5777,11955,289,22427,515,0001,019,0002,351,104
9Aug 6, 2022 21:5777,22754,545,07927,554,0001,020,0002,330,624
10Aug 6, 2022 21:5780,83691,327,78629,909,16502,318,336
11Aug 6, 2022 21:5781,82190,372,85030,273,83402,301,952
12Aug 6, 2022 21:5781,84991,763,80430,284,03602,314,240