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:36piculpiculScore: 596,376Success
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:36570,776282,852,222211,187,21302,224,128
2Sep 12, 2021 21:36596,376283,411,342220,659,15202,179,072
3Sep 12, 2021 21:36601,456276,045,450222,538,79502,285,568