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 listNov 12, 2025 21:24izotoffizotoffScore: 136,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 21:24101,164854,788,823670,632,000158,912,0002,334,720
2Nov 12, 2025 21:24136,5861,146,241,574945,158,000174,844,0002,277,376
3Nov 12, 2025 21:24148,3261,237,145,3711,028,386,000187,887,0002,437,120