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 listMar 4, 2026 00:52olliecrowolliecrowScore: 12,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 00:5212,216129,319,93699,167,0001,001,0002,428,928
2Mar 4, 2026 00:5212,251128,050,89599,458,0001,004,0002,420,736
3Mar 4, 2026 00:5212,258126,579,44899,510,0001,005,0002,428,928