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 listApr 26, 2026 04:20olliecrowolliecrowScore: 23,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 04:213,42150,117,62224,049,0004,008,0002,547,712
2Apr 26, 2026 04:213,42845,949,08624,100,0004,016,0002,383,872
3Apr 26, 2026 04:213,44445,181,74925,216,0003,025,0002,338,816
4Apr 26, 2026 04:213,46949,173,63824,389,0004,064,0002,510,848
5Apr 26, 2026 04:2123,447212,449,745188,267,0004,005,0002,326,528
6Apr 26, 2026 04:2123,478209,277,538189,515,0003,008,0002,351,104
7Apr 26, 2026 04:2123,489216,261,359187,626,0004,990,0002,375,680
8Apr 26, 2026 04:2123,489209,552,315187,626,0004,990,0002,326,528
9Apr 26, 2026 04:2123,529212,004,910189,946,0002,999,0002,433,024