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 4, 2026 20:06e1011e1011Score: 59,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 20:0750,566425,544,103273,598,000141,046,0002,113,536
2Nov 4, 2026 20:0751,438432,752,691281,098,000140,701,0002,113,536
3Nov 4, 2026 20:0756,079470,775,950318,802,000141,047,0002,113,536
4Nov 4, 2026 20:0757,015478,948,974326,707,000140,817,0002,113,536
5Nov 4, 2026 20:0759,592500,092,802347,619,000141,037,0002,113,536
6Nov 4, 2026 20:0763,054528,126,780375,624,000141,421,0002,113,536
7Nov 4, 2026 20:0769,331579,484,362426,721,000141,798,0002,113,536
8Nov 4, 2026 20:0779,351661,645,251509,848,000140,837,0002,113,536
9Nov 4, 2026 20:0783,911699,461,931546,606,000141,468,0002,113,536