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:43CemaCemaScore: 709,441Success
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:43707,923325,900,253261,931,41502,260,992
2May 22, 2024 19:43709,441326,500,914262,493,16402,248,704
3May 22, 2024 19:43713,175326,470,111263,874,65102,260,992