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 listJun 17, 2026 15:05Maya RebholzMaya RebholzScore: 11,796Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 15:0711,746105,695,49195,310,0001,011,0002,113,536
2Jun 17, 2026 15:0711,763105,679,01495,451,0001,012,0002,113,536
3Jun 17, 2026 15:0711,764105,685,45295,460,0001,012,0002,113,536
4Jun 17, 2026 15:0711,783105,730,12095,610,0001,014,0002,113,536
5Jun 17, 2026 15:0711,796106,417,95395,713,0001,020,0002,113,536
6Jun 17, 2026 15:0711,833106,634,50696,004,0001,032,0002,113,536
7Jun 17, 2026 15:0712,532112,515,326101,729,0001,035,0002,113,536
8Jun 17, 2026 15:0712,534112,016,995101,767,0001,014,0002,113,536
9Jun 17, 2026 15:0712,564112,260,909102,011,0001,017,0002,113,536