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 listNov 11, 2024 11:03Matt StuchlikMatt StuchlikScore: 9,180Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 11:028,83796,248,69768,435,0004,025,0002,265,088
2Nov 11, 2024 11:028,91594,131,98963,088,00010,013,0002,338,816
3Nov 11, 2024 11:039,08195,911,74565,408,0009,056,0002,363,392
4Nov 11, 2024 11:039,18098,968,98169,251,0006,021,0002,359,296
5Nov 11, 2024 11:039,29899,551,53468,218,0008,025,0002,428,928
6Nov 11, 2024 11:0210,133110,695,78977,086,0006,006,0002,510,848