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 listAug 28, 2023 20:26Franek KortaFranek KortaScore: 91,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 20:2690,55761,699,78933,506,00002,437,120
2Aug 28, 2023 20:2690,61956,656,84832,482,0001,047,0002,531,328
3Aug 28, 2023 20:2690,84157,576,31332,593,0001,018,0002,437,120
4Aug 28, 2023 20:2690,90058,729,75132,614,0001,019,0002,531,328
5Aug 28, 2023 20:2691,05763,597,92033,691,00002,441,216
6Aug 28, 2023 20:2691,21460,050,13331,764,0001,985,0002,445,312
7Aug 28, 2023 20:2691,49760,433,51132,859,000995,0002,445,312
8Aug 28, 2023 20:2691,51160,671,74633,859,00002,433,024
9Aug 28, 2023 20:2691,60554,000,20231,901,0001,993,0002,437,120
10Aug 28, 2023 20:26104,079120,896,61738,509,30902,211,840
11Aug 28, 2023 20:26104,53298,861,13238,676,90602,281,472
12Aug 28, 2023 20:26105,877111,683,68139,174,43202,174,976