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 7, 2024 23:42Joad NacerJoad NacerScore: 68,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2024 23:4268,183112,913,48525,227,62502,265,088
2May 7, 2024 23:4268,81284,363,52725,460,48002,260,992
3May 7, 2024 23:4268,91585,592,36725,498,44702,265,088