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:05Matt 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 11:0400000Error: expected "2247955590 ", got "0 "stderr
2Nov 11, 2024 11:057,92888,076,68156,008,0009,001,0002,478,080
3Nov 11, 2024 11:059,541100,653,58471,216,0007,021,0002,420,736
4Nov 11, 2024 11:0510,229111,672,62573,893,0009,985,0002,535,424