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 15, 2023 21:46Franek KortaFranek KortaScore: 116,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2023 21:46115,3491,013,359,589945,860,76402,187,264
2Apr 15, 2023 21:46116,0541,016,214,067951,640,41402,183,168
3Apr 15, 2023 21:46126,5571,092,076,2751,037,767,14602,183,168