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 12:34Victor MerckléVictor MerckléScore: 2,562Success
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 12:352,55229,267,13120,927,000024,576stderr
2Sep 8, 2026 12:352,55629,152,52520,966,000024,576stderr
3Sep 8, 2026 12:352,55729,326,04020,973,000024,576stderr
4Sep 8, 2026 12:352,56029,332,47520,994,000024,576stderr
5Sep 8, 2026 12:352,56229,387,30321,015,000024,576stderr
6Sep 8, 2026 12:352,63229,931,62321,583,000024,576stderr
7Sep 8, 2026 12:352,63429,941,38121,601,000024,576stderr
8Sep 8, 2026 12:355,39452,571,96643,222,0001,014,00024,576stderr
9Sep 8, 2026 12:355,41752,778,58743,406,0001,014,00024,576stderr