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 listMar 14, 2026 20:45Elijah KinElijah KinScore: 103,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 20:4587,952756,521,361543,400,000177,803,0002,412,544
2Mar 14, 2026 20:4590,188772,669,324549,660,000189,882,0002,347,008
3Mar 14, 2026 20:4591,675778,781,412564,804,000186,935,0002,326,528
4Mar 14, 2026 20:4598,604837,095,023625,651,000182,898,0002,314,240
5Mar 14, 2026 20:45103,473874,747,854655,598,000192,881,0002,306,048
6Mar 14, 2026 20:45106,071896,684,602667,836,000201,950,0002,269,184
7Mar 14, 2026 20:45107,578910,832,059687,331,000194,810,0002,297,856
8Mar 14, 2026 20:45108,710918,290,680690,554,000200,870,0002,310,144
9Mar 14, 2026 20:45113,779957,643,960739,200,000193,790,0002,478,080