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 11:39Karthik ReddyKarthik ReddyScore: 2,544Success
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 12:112,53929,697,54220,820,000020,480
2Oct 9, 2026 12:112,54129,758,82520,842,000020,480
3Oct 9, 2026 12:112,54229,726,71820,849,000020,480
4Oct 9, 2026 12:112,54430,401,96020,862,000020,480
5Oct 9, 2026 12:112,54429,739,33120,867,000020,480
6Oct 9, 2026 12:112,54530,243,81720,872,000020,480
7Oct 9, 2026 12:112,54529,867,04020,874,000020,480
8Oct 9, 2026 12:112,54830,311,73120,899,000020,480
9Oct 9, 2026 12:112,55129,702,03920,922,000020,480