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 01:31e1011e1011Score: 17,102Success
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 01:3317,070151,429,090138,971,0001,007,0002,113,536
2Nov 5, 2026 01:3317,088151,075,115139,116,0001,008,0002,113,536
3Nov 5, 2026 01:3317,091151,579,381138,146,0002,006,0002,113,536
4Nov 5, 2026 01:3317,101151,181,959139,224,0001,009,0002,113,536
5Nov 5, 2026 01:3317,102151,137,385139,232,0001,007,0002,113,536
6Nov 5, 2026 01:3317,118151,226,275139,363,0001,007,0002,113,536
7Nov 5, 2026 01:3317,118151,272,113138,355,0002,019,0002,113,536
8Nov 5, 2026 01:3317,125151,275,459139,422,0001,008,0002,113,536
9Nov 5, 2026 01:3317,164153,137,777138,740,0002,011,0002,113,536