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 6, 2024 23:52Joad NacerJoad NacerScore: 76,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2024 23:5276,33989,585,94628,245,60602,269,184
2May 6, 2024 23:5276,452106,046,37128,287,27402,273,280
3May 6, 2024 23:5277,17598,817,21728,554,88902,281,472