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 listJun 23, 2024 10:54Andrey LikhachevAndrey LikhachevScore: 60,963Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2024 10:5460,668566,789,258497,480,87402,285,568
2Jun 23, 2024 10:5460,963575,426,334499,896,74802,228,224
3Jun 23, 2024 10:5461,178562,275,774501,663,05902,310,144