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 listApr 3, 2023 21:49Franek KortaFranek KortaScore: 71,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 21:4971,54651,625,32725,454,0001,018,0002,527,232
2Apr 3, 2023 21:4971,58650,238,77526,487,00002,527,232
3Apr 3, 2023 21:4971,59244,575,94525,471,0001,018,0002,531,328
4Apr 3, 2023 21:4971,62449,072,26425,482,0001,019,0002,269,184
5Apr 3, 2023 21:4971,70045,344,59326,529,00002,527,232
6Apr 3, 2023 21:4971,76548,916,85826,553,00002,445,312
7Apr 3, 2023 21:4971,85745,654,69725,565,0001,022,0002,265,088
8Apr 3, 2023 21:4971,95453,734,34426,623,00002,527,232
9Apr 3, 2023 21:4971,98951,620,42525,612,0001,024,0002,265,088
10Apr 3, 2023 21:4976,02897,705,53428,130,21802,293,760
11Apr 3, 2023 21:4976,15893,921,27328,178,51602,174,976
12Apr 3, 2023 21:4976,38798,461,34928,263,19202,293,760