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 08:31Victor MerckléVictor MerckléScore: 2,595Success
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 08:332,58929,516,46621,231,000024,576stderr
2Sep 8, 2026 08:332,59129,656,35321,249,000024,576stderr
3Sep 8, 2026 08:332,59429,714,25321,277,000024,576stderr
4Sep 8, 2026 08:332,59429,559,95021,272,000024,576stderr
5Sep 8, 2026 08:332,59529,660,57521,287,000024,576stderr
6Sep 8, 2026 08:332,59829,692,82420,288,0001,022,00024,576stderr
7Sep 8, 2026 08:332,59830,447,16721,310,000024,576stderr
8Sep 8, 2026 08:335,35452,295,25442,890,0001,016,00024,576stderr
9Sep 8, 2026 08:335,36152,322,81142,950,0001,016,00024,576stderr