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 1, 2025 08:40KeefeKeefeScore: 27,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2025 08:4026,996248,005,213221,365,00002,281,472
2Jun 1, 2025 08:4027,231244,997,455222,292,0001,001,0002,400,256
3Jun 1, 2025 08:4027,306246,957,291222,912,000999,0002,281,472