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 14, 2021 12:40Mikhail ShirokovMikhail ShirokovScore: 22,090,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2021 12:3721,941,5678,174,829,6028,118,379,83502,289,664
2Sep 14, 2021 12:4022,027,2228,218,548,5548,150,072,32202,281,472
3Sep 14, 2021 12:3722,056,6648,211,894,2688,160,965,51002,285,568
4Sep 14, 2021 12:3722,090,9118,233,234,5368,173,637,04202,293,760
5Sep 14, 2021 12:4022,096,4538,237,676,0678,175,687,57202,281,472
6Sep 14, 2021 12:4022,268,0248,321,864,8998,239,168,87102,318,336