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 00:34Joad NacerJoad NacerScore: 69,475Success
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 00:3469,252101,651,80725,623,38502,256,896
2May 7, 2024 00:3469,47593,235,51125,705,71402,265,088
3May 7, 2024 00:3469,555100,551,20125,735,27602,269,184