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 27, 2024 00:11Joad NacerJoad NacerScore: 76,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2024 00:1175,827108,609,13728,055,82102,265,088
2May 27, 2024 00:1176,36298,918,09228,253,82602,269,184
3May 27, 2024 00:1176,83688,832,39728,429,31402,269,184