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 29, 2023 21:19Franek KortaFranek KortaScore: 63,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2023 21:1962,94944,021,20421,266,0002,025,0002,531,328
2Aug 29, 2023 21:1963,09747,764,14522,331,0001,015,0002,437,120
3Aug 29, 2023 21:1963,10848,425,53823,350,00002,441,216
4Aug 29, 2023 21:1963,18648,248,28123,379,00002,449,408
5Aug 29, 2023 21:1963,21947,264,92223,391,00002,531,328
6Aug 29, 2023 21:1963,25150,447,48522,386,0001,017,0002,531,328
7Aug 29, 2023 21:1963,28142,699,88322,396,0001,018,0002,445,312
8Aug 29, 2023 21:1963,32444,550,45621,393,0002,037,0002,265,088
9Aug 29, 2023 21:1963,58146,749,04522,503,0001,022,0002,531,328
10Aug 29, 2023 21:1967,59295,660,54725,008,88202,183,168
11Aug 29, 2023 21:1967,61691,669,31525,017,94602,297,856
12Aug 29, 2023 21:1968,12189,932,89225,204,72002,174,976