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 7, 2026 14:34Victor MerckléVictor MerckléScore: 6,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:353,90940,425,00430,922,0001,139,0002,121,728stderr
2Sep 7, 2026 14:353,91840,481,95531,001,0001,132,0002,121,728stderr
3Sep 7, 2026 14:353,93040,574,70831,083,0001,143,0002,121,728stderr
4Sep 7, 2026 14:354,00741,264,36131,731,0001,132,0002,121,728stderr
5Sep 7, 2026 14:356,53862,003,66752,425,0001,194,0002,121,728stderr
6Sep 7, 2026 14:356,60062,498,42752,899,0001,221,0002,121,728stderr
7Sep 7, 2026 14:356,64162,820,40053,431,0001,033,0002,121,728stderr
8Sep 7, 2026 14:356,64762,867,68052,499,0002,014,0002,121,728stderr
9Sep 7, 2026 14:356,76864,215,64953,367,0002,138,0002,121,728stderr