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 listJan 22, 2025 22:15Oleg KovalovOleg KovalovScore: 126,833Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 22:15122,0271,034,960,452803,893,000196,729,0002,281,472
2Jan 22, 2025 22:15126,8331,074,790,529841,218,000198,815,0002,301,952
3Jan 22, 2025 22:15132,8081,121,008,092894,201,000194,825,0002,314,240