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 07:14Karthik 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 07:152,53429,685,66320,782,000020,480
2Oct 9, 2026 07:152,53429,824,64320,780,000020,480
3Oct 9, 2026 07:152,53629,712,71220,800,000020,480
4Oct 9, 2026 07:152,53829,764,05820,812,000020,480
5Oct 9, 2026 07:152,54229,779,63720,851,000020,480
6Oct 9, 2026 07:152,54229,714,19920,851,000020,480
7Oct 9, 2026 07:152,54329,765,92020,855,000020,480
8Oct 9, 2026 07:152,54329,757,09420,853,000020,480
9Oct 9, 2026 07:152,54429,732,72120,863,000020,480