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 22, 2022 16:50Bernard 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 22, 2022 16:5000000Error: expected "2323134610 ", got "1"
2Nov 22, 2022 16:5000000Error: expected "2002413553 ", got "1"
3Nov 22, 2022 16:505,645115,117,78246,285,66602,281,472
4Nov 22, 2022 16:505,792105,795,52347,494,33302,220,032
5Nov 22, 2022 16:505,892122,982,52748,313,64102,232,320