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 listSep 19, 2026 18:19Andrew EpsteinAndrew EpsteinScore: 34,048Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 18:2033,801288,280,143276,166,0001,005,0002,117,632stderr
2Sep 19, 2026 18:2033,808287,760,455276,229,0001,004,0002,117,632stderr
3Sep 19, 2026 18:2033,860288,266,912275,646,0002,012,0002,117,632stderr
4Sep 19, 2026 18:2033,964288,891,471277,504,0001,003,0002,117,632stderr
5Sep 19, 2026 18:2034,048290,270,279278,192,0001,003,0002,117,632stderr
6Sep 19, 2026 18:2034,103290,156,348278,644,0001,006,0002,117,632stderr
7Sep 19, 2026 18:2048,543409,150,005397,052,0001,002,0002,117,632stderr
8Sep 19, 2026 18:2049,564416,890,619405,427,0001,003,0002,117,632stderr
9Sep 19, 2026 18:2049,740418,290,808406,869,0001,003,0002,117,632stderr