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 listMay 7, 2025 08:58KeefeKeefeScore: 11,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2025 08:5811,009111,008,00889,269,0001,003,0002,347,008
2May 7, 2025 08:5811,010117,020,45589,280,0001,003,0002,449,408
3May 7, 2025 08:5811,014112,587,61389,311,0001,003,0002,465,792
4May 7, 2025 08:5811,017112,189,73390,343,00002,342,912
5May 7, 2025 08:5811,019114,547,82890,357,00002,437,120
6May 7, 2025 08:5811,021117,686,63889,369,0001,004,0002,334,720
7May 7, 2025 08:5811,024112,493,81090,400,00002,322,432
8May 7, 2025 08:5811,025113,510,03789,400,0001,004,0002,437,120
9May 7, 2025 08:5811,031113,852,85689,464,000994,0002,449,408