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 14:28Karthik 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 14:462,52929,630,97820,742,000020,480
2Oct 9, 2026 14:462,53329,653,15820,774,000020,480
3Oct 9, 2026 14:462,53729,674,37220,806,000020,480
4Oct 9, 2026 14:462,53729,787,46320,804,000020,480
5Oct 9, 2026 14:462,54029,657,84120,832,000020,480
6Oct 9, 2026 14:462,54029,719,97920,829,000020,480
7Oct 9, 2026 14:462,54429,933,99919,855,0001,008,00020,480
8Oct 9, 2026 14:462,54629,799,84320,884,000020,480
9Oct 9, 2026 14:462,55429,769,56520,947,000020,480