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 21, 2022 17:32Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2022 17:3200000Error: expected "2245120568 ", got "2"
2Nov 21, 2022 17:3200000Error: expected "2134746222 ", got "2"
3Nov 21, 2022 17:3200000Error: expected "2178738380 ", got "2"
4Nov 21, 2022 17:3200000Error: expected "2136607245 ", got "2"
5Nov 21, 2022 17:3300000Error: expected "2054993948 ", got "2"