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:53Franek KortaFranek KortaScore: 77,322Success
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:5376,62256,313,02624,300,0004,050,0002,318,336
2Aug 6, 2022 21:5376,70358,336,94525,340,0003,040,0002,342,912
3Aug 6, 2022 21:5376,77650,340,46527,393,0001,014,0002,314,240
4Aug 6, 2022 21:5376,86851,676,79527,426,0001,015,0002,326,528
5Aug 6, 2022 21:5377,15950,390,57426,510,0002,039,0002,318,336
6Aug 6, 2022 21:5377,23257,855,64826,535,0002,041,0002,334,720
7Aug 6, 2022 21:5377,32264,845,34027,588,0001,021,0002,338,816
8Aug 6, 2022 21:5377,43057,187,59927,626,0001,023,0002,342,912
9Aug 6, 2022 21:5377,46555,683,02027,639,0001,023,0002,375,680
10Aug 6, 2022 21:5381,34997,178,53430,099,18202,301,952
11Aug 6, 2022 21:5381,548112,586,44230,172,63802,314,240
12Aug 6, 2022 21:5382,01293,928,93330,344,47002,289,664