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 listNov 4, 2026 21:38e1011e1011Score: 16,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 21:3816,678148,229,460134,600,0002,160,0002,113,536
2Nov 4, 2026 21:3816,739148,630,937135,248,0002,014,0002,113,536
3Nov 4, 2026 21:3816,744148,222,733135,142,0002,162,0002,113,536
4Nov 4, 2026 21:3816,771148,400,966135,514,0002,014,0002,113,536
5Nov 4, 2026 21:3816,806148,761,488135,802,0002,015,0002,113,536
6Nov 4, 2026 21:3816,808148,844,081135,814,0002,012,0002,113,536
7Nov 4, 2026 21:3816,811149,303,599135,841,0002,015,0002,113,536
8Nov 4, 2026 21:3816,819148,770,660135,908,0002,012,0002,113,536
9Nov 4, 2026 21:3817,126151,729,548137,421,0003,018,0002,113,536