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 listMar 28, 2023 18:37Yurkov AlekseyYurkov AlekseyScore: 163,193Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2023 18:37162,959123,924,60960,294,67802,252,800
2Mar 28, 2023 18:37163,193119,643,43460,381,26702,260,992
3Mar 28, 2023 18:37163,646115,370,54860,548,87902,252,800