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 listApr 19, 2024 10:49Joad NacerJoad NacerScore: 949,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2024 10:49947,6487,832,839,3957,770,713,85302,297,856
2Apr 19, 2024 10:49949,7047,854,731,4217,787,576,55302,297,856
3Apr 19, 2024 10:49950,8777,853,018,6967,797,193,35902,297,856