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 listDec 30, 2024 00:53Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2024 00:5300000Error: expected "2112629913 ", got "2112629887 "stderr
2Dec 30, 2024 00:5300000Error: expected "2152545407 ", got "2152545567 "stderr
3Dec 30, 2024 00:5400000Error: expected "2215793452 ", got "2131945507 "stderr
4Dec 30, 2024 00:5400000Error: No answer to stdout. Died or killed?stderr