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 listJul 2, 2026 01:17Victor MerckléVictor MerckléScore: 11,995Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 01:183,05132,937,84423,834,0001,188,0002,117,632stderr
2Jul 2, 2026 01:183,10433,341,20824,297,0001,159,0002,117,632stderr
3Jul 2, 2026 01:183,12833,605,41924,531,0001,126,0002,117,632stderr
4Jul 2, 2026 01:183,75538,731,22929,747,0001,045,0002,117,632stderr
5Jul 2, 2026 01:1811,995106,256,63397,359,0001,008,0002,117,632stderr
6Jul 2, 2026 01:1812,039106,691,83397,715,0001,009,0002,117,632stderr
7Jul 2, 2026 01:1812,059106,841,40497,876,0001,008,0002,117,632stderr
8Jul 2, 2026 01:1812,074106,922,81698,001,0001,010,0002,117,632stderr
9Jul 2, 2026 01:1812,652111,660,142102,741,0001,007,0002,117,632stderr