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 9, 2026 12:42Karthik ReddyKarthik ReddyScore: 2,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 13:022,52729,341,75720,725,000020,480
2Oct 9, 2026 13:022,53029,465,11820,750,000020,480
3Oct 9, 2026 13:022,53529,298,11620,792,000020,480
4Oct 9, 2026 13:022,53529,621,62620,794,000020,480
5Oct 9, 2026 13:022,53629,470,86420,796,000020,480
6Oct 9, 2026 13:022,53729,351,43420,807,000020,480
7Oct 9, 2026 13:022,53729,304,39720,810,000020,480
8Oct 9, 2026 13:022,54429,563,94120,861,000020,480
9Oct 9, 2026 13:022,54529,343,60520,869,000020,480