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 7, 2025 09:38AntonAntonScore: 101,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 7, 2025 09:38101,110854,206,474828,105,0001,000,0002,334,720
2Nov 7, 2025 09:38101,324859,609,528827,854,0002,999,0002,514,944
3Nov 7, 2025 09:38105,853890,561,501865,998,0001,999,0002,494,464