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 listDec 27, 2025 12:12Rajarshi BasuRajarshi BasuScore: 10,171Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 12:1210,144103,730,30581,174,0002,004,0002,527,232
2Dec 27, 2025 12:1210,148106,781,07680,209,0003,007,0002,514,944
3Dec 27, 2025 12:1210,166109,104,06881,355,0002,008,0002,510,848
4Dec 27, 2025 12:1210,167105,916,66281,362,0002,008,0002,514,944
5Dec 27, 2025 12:1210,171104,821,58280,386,0003,014,0002,514,944
6Dec 27, 2025 12:1210,171105,708,58881,397,0002,009,0002,514,944
7Dec 27, 2025 12:1210,195114,693,13881,586,0002,014,0002,523,136
8Dec 27, 2025 12:1210,209112,010,46181,721,0001,993,0002,326,528
9Dec 27, 2025 12:1210,216110,874,42382,773,000997,0002,326,528