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 listJan 9, 2025 08:01Ian MckibbenIan MckibbenScore: 973,234Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 08:01969,2857,985,150,4887,751,285,000196,854,0002,277,376
2Jan 9, 2025 08:01970,6857,989,695,9357,757,779,000201,838,0002,281,472
3Jan 9, 2025 08:01970,8907,995,596,9187,767,434,000193,861,0002,506,752
4Jan 9, 2025 08:01972,7518,009,918,8277,777,693,000198,864,0002,277,376
5Jan 9, 2025 08:01973,2348,012,056,6887,788,675,000191,844,0002,281,472
6Jan 9, 2025 08:01975,6378,030,278,1587,795,373,000204,852,0002,281,472
7Jan 9, 2025 08:01976,1698,036,126,0497,806,721,000197,866,0002,281,472
8Jan 9, 2025 08:01976,7708,039,231,3327,820,668,000188,847,0002,281,472
9Jan 9, 2025 08:01980,3018,077,074,4837,839,604,000198,863,0002,281,472