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 28, 2023 15:11apuxbtapuxbtScore: 179,874Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 15:11179,844124,691,67966,542,37502,273,280
2Sep 28, 2023 15:11179,874120,127,34966,553,54202,273,280
3Sep 28, 2023 15:11180,136134,557,41666,650,48202,273,280