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 listMay 26, 2024 23:49Joad NacerJoad NacerScore: 69,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2024 23:4969,24996,161,58425,622,29302,265,088
2May 26, 2024 23:4969,72292,380,54525,797,21902,265,088
3May 26, 2024 23:4969,72668,218,84425,798,45802,269,184