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 22, 2023 12:04AdrKAdrKScore: 1,237,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 22, 2023 12:04734,585336,932,121271,796,35902,293,760
2Nov 22, 2023 12:041,237,319515,179,055457,808,18102,301,952
3Nov 22, 2023 12:041,755,210704,742,269649,427,57802,297,856