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 14, 2024 08:31Matt 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 14, 2024 08:3100000Error: expected "2075019153 ", got "3646858600 "stderr
2Nov 14, 2024 08:3200000Error: expected "2160477409 ", got "3159535072 "stderr
3Nov 14, 2024 08:3200000Error: expected "2249833628 ", got "3685170452 "stderr
4Nov 14, 2024 08:3300000Error: expected "2044293253 ", got "120768232 "stderr