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 17:15Victor MerckléVictor MerckléScore: 2,634Success
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 17:162,62530,662,92821,526,000024,576stderr
2Sep 7, 2026 17:162,62930,733,46621,561,000024,576stderr
3Sep 7, 2026 17:162,62930,014,41221,560,000024,576stderr
4Sep 7, 2026 17:162,63030,710,84021,574,000024,576stderr
5Sep 7, 2026 17:162,63430,697,71021,604,000024,576stderr
6Sep 7, 2026 17:162,63729,903,90321,626,000024,576stderr
7Sep 7, 2026 17:162,63830,791,97121,635,000024,576stderr
8Sep 7, 2026 17:162,64130,092,85821,662,000024,576stderr
9Sep 7, 2026 17:165,30652,678,35242,490,0001,023,00024,576stderr