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:26Franek KortaFranek KortaScore: 64,743Success
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:2664,44948,356,09722,853,000993,0002,531,328
2Aug 29, 2023 20:2664,53046,672,78622,882,000994,0002,453,504
3Aug 29, 2023 20:2664,58147,366,58022,900,000995,0002,527,232
4Aug 29, 2023 20:2664,65743,175,35821,843,0002,080,0002,531,328
5Aug 29, 2023 20:2664,65751,497,62221,930,0001,993,0002,531,328
6Aug 29, 2023 20:2664,68949,270,02021,941,0001,994,0002,531,328
7Aug 29, 2023 20:2664,74346,708,37520,961,0002,994,0002,441,216
8Aug 29, 2023 20:2664,86846,895,39523,001,0001,000,0002,441,216
9Aug 29, 2023 20:2664,89550,770,09321,010,0003,001,0002,269,184
10Aug 29, 2023 20:2670,07779,720,74325,928,54402,285,568
11Aug 29, 2023 20:2670,40891,310,77426,050,87602,289,664
12Aug 29, 2023 20:2670,57990,493,47326,114,12402,293,760