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 listFeb 22, 2024 11:20Huy Duc LeHuy Duc LeError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 11:2000000Error: No answer to stdout. Died or killed?stderr
2Feb 22, 2024 11:2100000Error: No answer to stdout. Died or killed?stderr
3Feb 22, 2024 11:2100000Error: No answer to stdout. Died or killed?stderr
4Feb 22, 2024 11:2200000Error: expected "2220441436 ", got "2209999956 "stderr
5Feb 22, 2024 11:2200000Error: No answer to stdout. Died or killed?stderr
6Feb 22, 2024 11:2300000Error: expected "2302823282 ", got "2209999966 "stderr
7Feb 22, 2024 11:2300000Error: No answer to stdout. Died or killed?stderr
8Feb 22, 2024 11:256,097115,301,08549,993,15602,224,128
9Feb 22, 2024 11:256,109105,372,75550,090,01302,203,648
10Feb 22, 2024 11:256,532126,256,74653,563,37602,183,168