Median Sergey Svistunov

Find the median of 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 median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listSep 7, 2022 16:43eldon-chungeldon-chungScore: 48,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2022 16:4346,197447,964,543378,815,00802,277,376
2Sep 7, 2022 16:4346,870454,506,497384,331,70002,293,760
3Sep 7, 2022 16:4147,171459,711,425386,802,76702,191,360
4Sep 7, 2022 16:4348,181471,376,242395,084,91802,215,936
5Sep 7, 2022 16:4148,602450,883,455398,535,77302,277,376
6Sep 7, 2022 16:4148,706474,645,431399,391,92302,269,184
7Sep 7, 2022 16:4148,735468,871,428399,627,41702,228,224
8Sep 7, 2022 16:4349,412475,611,419405,181,53902,277,376
9Sep 7, 2022 16:4150,293470,414,555412,399,28102,179,072
10Sep 7, 2022 16:4350,699487,608,825415,731,13602,187,264
11Sep 7, 2022 16:4151,430481,592,574421,723,86102,277,376
12Sep 7, 2022 16:4351,631506,859,115423,376,23402,191,360