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:38Karthik ReddyKarthik ReddyScore: 2,540Success
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:032,53229,705,41620,769,000020,480
2Oct 9, 2026 12:032,53429,682,25220,786,000020,480
3Oct 9, 2026 12:032,53629,674,03620,796,000020,480
4Oct 9, 2026 12:032,53829,712,01820,815,000020,480
5Oct 9, 2026 12:032,54029,732,57420,828,000020,480
6Oct 9, 2026 12:032,54129,711,49720,837,000020,480
7Oct 9, 2026 12:032,54329,809,53320,853,000020,480
8Oct 9, 2026 12:032,54429,803,70920,866,000020,480
9Oct 9, 2026 12:032,56229,936,07819,909,0001,105,00020,480