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 listSep 8, 2026 14:32Victor MerckléVictor MerckléScore: 2,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 14:342,55229,323,14820,931,000024,576stderr
2Sep 8, 2026 14:342,55829,199,52420,982,000024,576stderr
3Sep 8, 2026 14:342,56029,310,55620,998,000024,576stderr
4Sep 8, 2026 14:342,62730,060,62121,545,000024,576stderr
5Sep 8, 2026 14:342,63230,114,90921,587,000024,576stderr
6Sep 8, 2026 14:342,64930,852,29021,726,000024,576stderr
7Sep 8, 2026 14:345,38752,457,18043,164,0001,014,00024,576stderr
8Sep 8, 2026 14:345,41352,656,23843,377,0001,016,00024,576stderr
9Sep 8, 2026 14:345,42352,851,17243,459,0001,014,00024,576stderr