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 6, 2025 20:21Aniruddha DebAniruddha DebScore: 11,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2025 20:2110,962114,582,28087,891,0001,997,0002,510,848
2May 6, 2025 20:2111,047116,731,92588,592,0001,990,0002,461,696
3May 6, 2025 20:2111,048120,450,08289,596,000995,0002,498,560
4May 6, 2025 20:2111,048114,735,10190,595,00002,473,984
5May 6, 2025 20:2111,105117,399,98689,061,0002,001,0002,330,624
6May 6, 2025 20:2111,215117,494,79390,961,000999,0002,420,736
7May 6, 2025 20:2111,605114,994,69594,158,0001,001,0002,338,816
8May 6, 2025 20:2111,624121,322,41395,319,00002,510,848
9May 6, 2025 20:2111,678124,206,45393,747,0002,016,0002,408,448