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 listSep 2, 2023 21:41Franek KortaFranek KortaScore: 65,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2023 21:4964,923101,925,34324,021,47702,293,760
2Sep 2, 2023 21:4165,007103,233,89524,052,41002,297,856
3Sep 2, 2023 21:4165,03579,719,96124,063,12902,301,952
4Sep 2, 2023 21:4165,12168,993,73124,094,67502,183,168
5Sep 2, 2023 21:5665,13986,038,96624,101,52302,293,760
6Sep 2, 2023 21:4965,146101,085,43624,104,00902,297,856
7Sep 2, 2023 21:4965,23586,616,73724,137,02602,301,952
8Sep 2, 2023 21:5665,27294,693,13724,150,51602,179,072
9Sep 2, 2023 21:5665,414101,027,51124,203,06402,297,856