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:43Karthik ReddyKarthik ReddyScore: 2,542Success
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:052,53629,752,22420,797,000020,480
2Oct 9, 2026 13:052,53829,742,25720,818,000020,480
3Oct 9, 2026 13:052,54029,714,55420,830,000020,480
4Oct 9, 2026 13:052,54129,808,54120,841,000020,480
5Oct 9, 2026 13:052,54229,756,08720,851,000020,480
6Oct 9, 2026 13:052,54329,637,26620,860,000020,480
7Oct 9, 2026 13:052,54629,729,77220,881,000020,480
8Oct 9, 2026 13:052,54729,841,25820,893,000020,480
9Oct 9, 2026 13:052,54829,785,86520,897,000020,480