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 2, 2022 08:47Robert BurkeRobert BurkeScore: 62,697Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 08:4762,43252,176,46821,092,0002,008,0002,281,472
2Aug 2, 2022 08:4762,51448,890,17022,125,0001,005,0002,281,472
3Aug 2, 2022 08:4762,54346,710,10122,135,0001,006,0002,433,024
4Aug 2, 2022 08:4762,60546,540,97921,150,0002,014,0002,281,472
5Aug 2, 2022 08:4762,64150,423,65722,170,0001,007,0002,433,024
6Aug 2, 2022 08:4762,66253,412,60522,177,0001,008,0002,281,472
7Aug 2, 2022 08:4762,69747,642,62121,181,0002,017,0002,281,472
8Aug 2, 2022 08:4762,70050,305,67722,191,0001,008,0002,420,736
9Aug 2, 2022 08:4762,77053,077,03721,206,0002,019,0002,433,024
10Aug 2, 2022 08:4765,41386,798,33824,202,73602,285,568
11Aug 2, 2022 08:4765,78081,219,46024,338,63002,285,568
12Aug 2, 2022 08:4765,90481,215,01724,384,33302,256,896