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 22, 2025 21:31Adam FolwarcznyAdam FolwarcznyScore: 58,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 21:3156,125480,585,534458,221,0002,000,0002,510,848
2Jun 22, 2025 21:3158,957511,421,834480,451,0002,996,0002,281,472
3Jun 22, 2025 21:3159,939515,450,457489,496,0002,002,0002,396,160