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 19:17Franek KortaFranek KortaScore: 74,268Success
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 19:1774,03048,795,74826,377,0001,014,0002,269,184
2Aug 6, 2022 19:1774,07849,018,69225,379,0002,030,0002,269,184
3Aug 6, 2022 19:1774,19551,391,73826,436,0001,016,0002,535,424
4Aug 6, 2022 19:1774,19749,425,71626,437,0001,016,0002,269,184
5Aug 6, 2022 19:1774,22448,777,83925,429,0002,034,0002,375,680
6Aug 6, 2022 19:1774,26851,101,87126,462,0001,017,0002,281,472
7Aug 6, 2022 19:1774,26856,283,57325,444,0002,035,0002,281,472
8Aug 6, 2022 19:1774,27849,904,24824,430,0003,053,0002,269,184
9Aug 6, 2022 19:1774,44355,458,37225,504,0002,040,0002,285,568
10Aug 6, 2022 19:1777,411100,703,05228,642,19102,265,088
11Aug 6, 2022 19:1778,23992,679,22928,948,41402,293,760
12Aug 6, 2022 19:1778,67395,554,63729,108,87202,269,184