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 28, 2023 20:41Franek KortaFranek KortaScore: 87,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 20:4186,44653,261,05730,986,000999,0002,437,120
2Aug 28, 2023 20:4186,72253,369,03831,085,0001,002,0002,531,328
3Aug 28, 2023 20:4186,77051,208,30731,102,0001,003,0002,445,312
4Aug 28, 2023 20:4186,88157,076,32231,142,0001,004,0002,269,184
5Aug 28, 2023 20:4186,93254,928,87531,160,0001,005,0002,437,120
6Aug 28, 2023 20:4187,01656,114,37429,178,0003,018,0002,433,024
7Aug 28, 2023 20:4187,26557,711,64131,279,0001,009,0002,527,232
8Aug 28, 2023 20:4187,91953,378,30132,530,00002,527,232
9Aug 28, 2023 20:4188,43853,067,65832,722,00002,269,184
10Aug 28, 2023 20:41102,18093,828,10937,806,64502,289,664
11Aug 28, 2023 20:41102,712106,139,96038,003,31802,277,376
12Aug 28, 2023 20:41102,81297,889,80138,040,37302,285,568