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 11:20Victor MerckléVictor MerckléScore: 2,598Success
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 11:212,55729,223,06320,969,000024,576stderr
2Sep 8, 2026 11:212,56129,631,66821,004,000024,576stderr
3Sep 8, 2026 11:212,56130,670,66421,005,000024,576stderr
4Sep 8, 2026 11:212,59429,596,68521,275,000024,576stderr
5Sep 8, 2026 11:212,59829,521,58121,311,000024,576stderr
6Sep 8, 2026 11:212,68231,764,76921,995,000024,576stderr
7Sep 8, 2026 11:215,45453,856,86143,711,0001,014,00024,576stderr
8Sep 8, 2026 11:215,47453,862,67543,879,0001,013,00024,576stderr
9Sep 8, 2026 11:215,48553,284,71943,966,0001,013,00024,576stderr