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 5, 2026 04:18e1011e1011Score: 23,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2026 04:1923,037199,834,837186,898,0002,009,0002,113,536
2Nov 5, 2026 04:1923,057200,057,917187,059,0002,011,0002,113,536
3Nov 5, 2026 04:1923,081200,507,159187,260,0002,010,0002,113,536
4Nov 5, 2026 04:1923,091200,719,613187,340,0002,013,0002,113,536
5Nov 5, 2026 04:1923,119200,391,677187,566,0002,011,0002,113,536
6Nov 5, 2026 04:1923,165201,328,420187,951,0002,009,0002,113,536
7Nov 5, 2026 04:1923,168201,123,679187,969,0002,010,0002,113,536
8Nov 5, 2026 04:1923,231201,961,840188,483,0002,013,0002,113,536
9Nov 5, 2026 04:1923,342202,277,276189,394,0002,016,0002,113,536