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 15:41Karthik ReddyKarthik ReddyScore: 2,543Success
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 16:192,53329,631,80120,772,000020,480
2Oct 9, 2026 16:192,53429,762,99320,786,000020,480
3Oct 9, 2026 16:192,53629,785,78520,801,000020,480
4Oct 9, 2026 16:192,54229,952,17120,852,000020,480
5Oct 9, 2026 16:192,54329,728,32320,858,000020,480
6Oct 9, 2026 16:192,54329,956,52220,857,000020,480
7Oct 9, 2026 16:192,54531,489,39420,876,000020,480
8Oct 9, 2026 16:192,54730,002,26620,888,000020,480
9Oct 9, 2026 16:192,54829,889,00620,899,000020,480