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 13:01Victor MerckléVictor MerckléScore: 2,644Success
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 13:052,55229,341,26320,931,000024,576stderr
2Sep 8, 2026 13:052,55929,289,80420,984,000024,576stderr
3Sep 8, 2026 13:052,56129,365,54121,001,000024,576stderr
4Sep 8, 2026 13:052,57929,537,48321,155,000024,576stderr
5Sep 8, 2026 13:052,64430,025,91021,684,000024,576stderr
6Sep 8, 2026 13:052,64630,766,98521,699,000024,576stderr
7Sep 8, 2026 13:052,66330,170,80721,841,000024,576stderr
8Sep 8, 2026 13:052,66430,985,22721,847,000024,576stderr
9Sep 8, 2026 13:0511,03098,671,08089,434,0001,012,00024,576stderr