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 22:05e1011e1011Score: 15,633Success
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 22:0615,443137,993,407124,346,0002,289,0002,113,536
2Nov 4, 2026 22:0615,502138,546,636125,108,0002,013,0002,113,536
3Nov 4, 2026 22:0615,531138,713,227125,335,0002,025,0002,113,536
4Nov 4, 2026 22:0615,623139,093,732126,096,0002,013,0002,113,536
5Nov 4, 2026 22:0615,633139,579,493126,157,0002,036,0002,113,536
6Nov 4, 2026 22:0615,643139,735,327126,248,0002,026,0002,113,536
7Nov 4, 2026 22:0615,645139,102,781126,267,0002,026,0002,113,536
8Nov 4, 2026 22:0615,678140,777,652126,536,0002,025,0002,113,536
9Nov 4, 2026 22:0615,770140,718,255127,306,0002,015,0002,113,536