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 12, 2023 23:13Yurkov AlekseyYurkov AlekseyScore: 178,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2023 23:13176,908127,263,82765,456,03202,256,896
2May 12, 2023 23:13178,435125,941,63466,020,87402,273,280
3May 12, 2023 23:13179,790131,430,50366,522,38502,269,184