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 listJul 7, 2021 22:11Yuriy LyfenkoYuriy LyfenkoScore: 9,565,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2021 22:11263,274540,754,22597,411,289058,888,192
2Jul 7, 2021 22:11269,566620,760,59399,739,309061,337,600
3Jul 7, 2021 22:11272,708638,811,695100,901,933062,685,184
4Jul 7, 2021 22:119,565,4693,600,907,9923,539,223,35102,236,416
5Jul 7, 2021 22:119,588,7503,608,169,1593,547,837,63802,310,144
6Jul 7, 2021 22:1119,279,5327,197,909,5407,133,426,76302,281,472