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 24, 2023 21:52mmalczakmmalczakScore: 75,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2023 21:5274,834102,712,52727,688,71602,265,088
2Sep 24, 2023 21:5275,400102,809,80827,897,95802,265,088
3Sep 24, 2023 21:5275,703103,352,04228,010,23502,273,280