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 22, 2023 15:03KiratKiratScore: 1,933,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 22, 2023 15:031,813,602738,239,224671,032,91502,281,472
2Sep 22, 2023 15:031,933,862786,175,352715,528,83502,293,760
3Sep 22, 2023 15:032,342,151935,953,817866,595,93302,285,568