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 20:29Franek KortaFranek KortaScore: 64,654Success
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 20:2964,45146,864,43822,854,000993,0002,527,232
2Aug 29, 2023 20:2964,46551,701,34422,859,000993,0002,428,928
3Aug 29, 2023 20:2964,47048,351,44723,854,00002,441,216
4Aug 29, 2023 20:2964,48954,106,46521,873,0001,988,0002,265,088
5Aug 29, 2023 20:2964,49253,117,05222,868,000994,0002,445,312
6Aug 29, 2023 20:2964,55751,389,48723,886,00002,269,184
7Aug 29, 2023 20:2964,58444,555,56623,896,00002,531,328
8Aug 29, 2023 20:2964,65445,952,15322,926,000996,0002,433,024
9Aug 29, 2023 20:2965,00543,432,38522,048,0002,004,0002,437,120
10Aug 29, 2023 20:2968,70294,188,87825,419,66602,293,760
11Aug 29, 2023 20:2968,71782,093,47025,425,12102,277,376
12Aug 29, 2023 20:2968,85597,562,60825,476,50702,293,760
13Aug 29, 2023 20:2968,88394,219,65825,486,73702,174,976
14Aug 29, 2023 20:2969,16784,440,24225,591,67302,174,976
15Aug 29, 2023 20:2969,350107,116,12225,659,50302,281,472