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 27, 2023 16:51apuxbtapuxbtScore: 5,697,374Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2023 16:515,481,1242,084,298,0852,028,016,00902,273,280
2Sep 27, 2023 16:515,697,3742,176,679,6352,108,028,55702,281,472
3Sep 27, 2023 16:515,759,6072,190,996,0792,131,054,47202,203,648