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 25, 2023 22:43mmalczakmmalczakScore: 74,320Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2023 22:4574,101105,053,35027,417,45802,265,088
2Sep 25, 2023 22:4574,16792,418,65727,441,63802,277,376
3Sep 25, 2023 22:4574,27394,452,72127,481,05002,277,376
4Sep 25, 2023 22:4374,32090,618,78927,498,38002,269,184
5Sep 25, 2023 22:4374,32194,774,37027,498,79802,265,088
6Sep 25, 2023 22:4374,35289,144,08227,510,26902,269,184