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 16, 2024 22:53CheranMahalingamCheranMahalingamScore: 774,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2024 22:53771,986312,804,47885,890,000199,745,0002,375,680
2Sep 16, 2024 22:53774,946316,353,76088,916,000197,814,0002,347,008
3Sep 16, 2024 22:53790,543323,329,29084,855,000207,646,0002,310,144