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 12, 2021 21:40piculpiculScore: 167,550Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2021 21:40167,332124,041,15961,913,01602,301,952
2Sep 12, 2021 21:40167,550120,307,61361,993,66002,179,072
3Sep 12, 2021 21:40167,650124,505,24262,030,41302,289,664