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 25, 2024 02:26Joad 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 25, 2024 02:2500000Error: No answer to stdout. Died or killed?stderr
2Dec 25, 2024 02:2600000Error: No answer to stdout. Died or killed?stderr
3Dec 25, 2024 02:2600000Error: expected "2240262688 ", got "2214098862 "stderr
4Dec 25, 2024 02:2600000Error: expected "2254698480 ", got "2159316844 "stderr
5Dec 25, 2024 02:265,53265,704,12943,346,0002,016,0002,510,848
6Dec 25, 2024 02:265,62171,081,51145,091,0001,002,0002,510,848
7Dec 25, 2024 02:265,76777,021,12544,269,0003,018,0002,396,160