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:19Franek KortaFranek KortaScore: 74,270Success
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:1973,66547,137,11025,237,0002,019,0002,527,232
2Aug 6, 2022 21:1973,79550,334,47426,293,0001,011,0002,281,472
3Aug 6, 2022 21:1973,85455,219,44625,302,0002,024,0002,531,328
4Aug 6, 2022 21:1974,08453,224,71427,411,00002,375,680
5Aug 6, 2022 21:1974,09251,463,79926,399,0001,015,0002,383,872
6Aug 6, 2022 21:1974,10355,941,32025,387,0002,031,0002,277,376
7Aug 6, 2022 21:1974,27049,740,50226,463,0001,017,0002,265,088
8Aug 6, 2022 21:1974,28951,840,83026,469,0001,018,0002,265,088
9Aug 6, 2022 21:1974,54653,719,85926,561,0001,021,0002,273,280
10Aug 6, 2022 21:1978,13385,105,73728,909,24602,265,088
11Aug 6, 2022 21:1978,545110,291,17529,061,77102,265,088
12Aug 6, 2022 21:1978,94195,942,88829,208,07102,273,280