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 listMar 31, 2023 17:59Franek KortaFranek KortaScore: 154,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2023 17:59153,318117,212,67256,727,71702,301,952
2Mar 31, 2023 17:59154,760114,037,71757,261,21602,289,664
3Mar 31, 2023 17:59155,892111,450,87857,679,89802,293,760