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 listOct 1, 2026 16:49C21C21Score: 3,315Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 16:503,28737,925,58525,895,0001,066,0002,113,536
2Oct 1, 2026 16:503,30137,726,38825,913,0001,161,0002,113,536
3Oct 1, 2026 16:503,30938,073,05525,976,0001,165,0002,113,536
4Oct 1, 2026 16:503,31037,925,88125,036,0002,111,0002,113,536
5Oct 1, 2026 16:503,31537,974,91425,088,0002,103,0002,113,536
6Oct 1, 2026 16:503,32637,909,93825,173,0002,102,0002,113,536
7Oct 1, 2026 16:503,32738,489,41625,095,0002,189,0002,113,536
8Oct 1, 2026 16:503,33537,989,90125,271,0002,080,0002,113,536
9Oct 1, 2026 16:503,36542,756,44325,575,0002,026,0002,113,536