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:20Joad NacerJoad NacerScore: 79,037Success
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:2078,39087,668,45629,004,23902,269,184
2May 27, 2024 00:2079,03799,649,10429,243,76702,260,992
3May 27, 2024 00:2079,123112,875,78829,275,59602,256,896