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:48mmalczakmmalczakError
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:5000000Error: expected "429496496184 ", got "429496496141 "
2Sep 24, 2023 21:5174,26194,599,86027,476,47102,277,376
3Sep 24, 2023 21:4874,35389,162,39327,510,42902,269,184
4Sep 24, 2023 21:4874,769104,722,33827,664,45702,269,184
5Sep 24, 2023 21:5174,85497,800,41427,695,96802,265,088
6Sep 24, 2023 21:5175,006103,957,92227,752,34902,265,088
7Sep 24, 2023 21:4875,64399,650,75727,987,87402,265,088