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 listOct 12, 2024 22:28zielajzielajScore: 1,067,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2024 22:281,059,04511,246,041,2847,679,457,0001,004,714,000180,224
2Oct 12, 2024 22:281,067,97511,539,195,7237,728,291,0001,029,106,000180,224
3Oct 12, 2024 22:281,068,52111,675,905,3937,709,770,0001,052,105,000274,432