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 11, 2021 07:11Sergey StreminSergey StreminScore: 137,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2021 07:11136,474123,768,92350,495,27502,211,840
2Sep 11, 2021 07:11137,308120,679,63350,804,12402,207,744
3Sep 11, 2021 07:11137,838126,964,00250,999,99002,187,264