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:30e1011e1011Score: 13,954Success
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:3113,828124,283,658111,379,0002,013,0002,113,536
2Nov 5, 2026 04:3113,865124,634,879111,668,0002,031,0002,113,536
3Nov 5, 2026 04:3113,904125,014,280112,006,0002,014,0002,113,536
4Nov 5, 2026 04:3113,926125,045,202112,169,0002,026,0002,113,536
5Nov 5, 2026 04:3113,954125,289,158112,403,0002,022,0002,113,536
6Nov 5, 2026 04:3114,006125,774,932112,838,0002,016,0002,113,536
7Nov 5, 2026 04:3114,006125,957,767112,838,0002,012,0002,113,536
8Nov 5, 2026 04:3114,023125,885,656112,964,0002,026,0002,113,536
9Nov 5, 2026 04:3114,099126,519,794113,589,0002,028,0002,113,536