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 28, 2025 19:47Adam FolwarcznyAdam FolwarcznyScore: 69,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2025 19:4764,891561,943,562509,103,00023,004,0002,306,048
2Jun 28, 2025 19:4769,641597,530,240543,053,00028,002,0002,514,944
3Jun 28, 2025 19:4770,263598,074,494553,153,00023,006,0002,494,464