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 22, 2024 19:46CemaCemaScore: 711,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 19:46710,512323,810,965262,889,47002,252,800
2May 22, 2024 19:46711,974319,204,728263,430,40402,256,896
3May 22, 2024 19:46718,566328,747,613265,869,30202,260,992