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 06:04Matt StuchlikMatt StuchlikError
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 06:0300000Error: expected "2319780044 ", got "0 "stderr
2Nov 11, 2024 06:0411,612116,178,47487,204,0008,018,0002,465,792
3Nov 11, 2024 06:0412,475121,432,51098,288,0004,011,0002,461,696
4Nov 11, 2024 06:0413,730139,505,835101,527,00011,057,0002,473,984