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 20, 2024 10:47Huy 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 20, 2024 10:4600000Error: No answer to stdout. Died or killed?stderr
2Feb 20, 2024 10:4600000Error: No answer to stdout. Died or killed?stderr
3Feb 20, 2024 10:4729,297330,099,326240,234,63202,228,224
4Feb 20, 2024 10:4730,012302,064,399246,096,64202,256,896
5Feb 20, 2024 10:4731,862319,781,208261,270,12602,244,608