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 listMar 25, 2024 15:36IhebIhebScore: 94,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2024 15:3688,866791,623,507728,700,52702,277,376
2Mar 25, 2024 15:3694,471840,633,463774,659,49102,285,568
3Mar 25, 2024 15:36102,687904,562,449842,035,79102,281,472