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 15:43Victor MerckléVictor MerckléScore: 2,659Success
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 15:442,57629,327,34721,129,000024,576stderr
2Sep 8, 2026 15:442,57929,573,18521,154,000024,576stderr
3Sep 8, 2026 15:442,65430,021,33321,764,000024,576stderr
4Sep 8, 2026 15:442,65431,000,86321,768,000024,576stderr
5Sep 8, 2026 15:442,65930,887,66321,809,000024,576stderr
6Sep 8, 2026 15:442,66231,015,89121,829,000024,576stderr
7Sep 8, 2026 15:442,66230,245,11621,832,000024,576stderr
8Sep 8, 2026 15:442,66430,112,26121,851,000024,576stderr
9Sep 8, 2026 15:442,66630,223,32421,869,000024,576stderr