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 listMay 1, 2026 18:15Pavel SkripkinPavel SkripkinScore: 14,336Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 18:1514,329134,030,885116,501,0001,004,0002,424,832
2May 1, 2026 18:1514,335134,960,754116,546,0001,004,0002,428,928
3May 1, 2026 18:1514,335132,989,692116,546,0001,004,0002,420,736
4May 1, 2026 18:1514,335136,830,562115,557,0001,992,0002,420,736
5May 1, 2026 18:1514,336133,522,822116,557,0001,004,0002,420,736
6May 1, 2026 18:1514,363137,608,524115,788,0001,996,0002,420,736
7May 1, 2026 18:1514,367133,718,236114,817,0002,995,0002,326,528
8May 1, 2026 18:1514,371135,816,719115,851,0001,997,0002,437,120
9May 1, 2026 18:1514,372136,062,387115,857,0001,997,0002,420,736