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 18, 2026 04:49Josu San MartinJosu San MartinScore: 17,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 04:4917,223167,881,097140,229,0001,001,0002,281,472
2Jan 18, 2026 04:4917,283168,692,669139,728,0001,996,0002,281,472
3Jan 18, 2026 04:4917,351163,567,506142,281,00002,281,472