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:39e1011e1011Score: 17,018Success
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:4016,951151,863,682137,992,0001,013,0002,113,536
2Nov 4, 2026 21:4016,979150,616,088138,220,0001,008,0002,113,536
3Nov 4, 2026 21:4016,991150,153,957138,323,0001,007,0002,113,536
4Nov 4, 2026 21:4017,008150,310,575138,459,0001,012,0002,113,536
5Nov 4, 2026 21:4017,018150,517,668138,540,0001,008,0002,113,536
6Nov 4, 2026 21:4017,021150,684,139137,561,0002,015,0002,113,536
7Nov 4, 2026 21:4017,021151,090,695138,571,0001,007,0002,113,536
8Nov 4, 2026 21:4017,034151,009,124138,676,0001,007,0002,113,536
9Nov 4, 2026 21:4017,041150,600,542138,729,0001,013,0002,113,536