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:01Matt 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:0100000Error: No answer to stdout. Died or killed?stderr
2Nov 11, 2024 11:018,02692,009,09759,831,0005,983,0002,330,624
3Nov 11, 2024 11:019,768102,516,10870,084,00010,012,0002,318,336
4Nov 11, 2024 11:019,960107,335,22176,634,0005,041,0002,334,720