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 9, 2023 20:48Franek KortaFranek KortaScore: 250,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 20:48249,392158,752,22192,274,87402,289,664
2Apr 9, 2023 20:48250,222150,819,54492,582,27102,293,760
3Apr 9, 2023 20:48254,456150,575,77494,148,80602,179,072