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 listNov 21, 2023 10:32AdrKAdrKScore: 1,269,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2023 10:321,224,160511,639,922452,939,10402,293,760
2Nov 21, 2023 10:321,269,690531,313,462469,785,40302,289,664
3Nov 21, 2023 10:321,804,262732,717,177667,577,02202,306,048