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 8, 2026 06:46Victor MerckléVictor MerckléScore: 2,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 06:472,59429,661,04121,276,000024,576stderr
2Sep 8, 2026 06:472,59829,694,75121,305,000024,576stderr
3Sep 8, 2026 06:472,63038,964,86121,568,000024,576stderr
4Sep 8, 2026 06:472,63637,286,49321,623,000024,576stderr
5Sep 8, 2026 06:472,64540,316,52221,695,000024,576stderr
6Sep 8, 2026 06:472,96732,669,72420,518,0003,814,00024,576stderr
7Sep 8, 2026 06:473,28235,104,60820,583,0006,336,00024,576stderr
8Sep 8, 2026 06:475,27751,926,41642,265,0001,009,00024,576stderr
9Sep 8, 2026 06:475,48453,198,23742,378,0002,594,00024,576stderr