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 listJun 20, 2021 12:49Andrey TsvetkovAndrey TsvetkovScore: 113,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2021 12:4984,738752,658,311694,853,72102,195,456
2Jun 20, 2021 12:4993,967828,725,859770,532,02602,199,552
3Jun 20, 2021 12:48104,493920,258,160856,846,60702,191,360
4Jun 20, 2021 12:48106,164919,628,529870,541,53502,195,456
5Jun 20, 2021 12:49113,4231,010,962,815930,070,93502,203,648
6Jun 20, 2021 12:49116,4051,008,537,384954,520,50402,199,552
7Jun 20, 2021 12:49116,9091,024,675,850958,655,84702,195,456
8Jun 20, 2021 12:48118,9211,048,766,248975,153,95702,314,240
9Jun 20, 2021 12:49131,3351,139,511,4691,076,943,45202,199,552