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 listSep 11, 2021 07:06Sergey StreminSergey StreminScore: 147,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2021 07:06146,586126,406,30254,236,90402,199,552
2Sep 11, 2021 07:06147,772116,439,50754,675,74802,285,568
3Sep 11, 2021 07:06151,824120,498,28156,175,05002,310,144