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:15Joad NacerJoad NacerScore: 69,793Success
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:1569,45991,318,44725,699,98702,269,184
2May 27, 2024 00:1569,79391,021,54625,823,27302,256,896
3May 27, 2024 00:1569,875100,155,20025,853,64402,273,280