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 listOct 12, 2024 22:26zielajzielajScore: 946,501Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2024 22:26942,0977,756,683,9657,567,338,000157,861,0002,281,472
2Oct 12, 2024 22:26943,2367,774,763,6417,578,685,000155,849,0002,461,696
3Oct 12, 2024 22:26944,5387,778,847,2937,591,344,000153,865,0002,281,472
4Oct 12, 2024 22:26944,7897,783,745,2957,594,399,000152,867,0002,310,144
5Oct 12, 2024 22:26946,5017,790,660,6037,606,446,000154,866,0002,281,472
6Oct 12, 2024 22:26946,8637,795,241,9447,607,409,000156,864,0002,281,472
7Oct 12, 2024 22:26947,3847,798,314,7267,610,681,000157,868,0002,281,472
8Oct 12, 2024 22:26947,4617,804,806,2927,612,317,000156,862,0002,285,568
9Oct 12, 2024 22:26952,1067,842,653,6107,650,407,000156,864,0002,396,160