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 listJun 12, 2026 10:14Victor MerckléVictor MerckléScore: 3,420Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 10:153,35736,555,57526,488,0001,043,0002,113,536
2Jun 12, 2026 10:153,36036,666,19126,497,0001,060,0002,113,536
3Jun 12, 2026 10:153,37836,758,47326,659,0001,041,0002,113,536
4Jun 12, 2026 10:153,40337,023,33525,868,0002,043,0002,113,536
5Jun 12, 2026 10:153,42037,108,33425,999,0002,051,0002,113,536
6Jun 12, 2026 10:153,42437,170,28026,008,0002,072,0002,113,536
7Jun 12, 2026 10:153,50837,836,41926,569,0002,203,0002,113,536
8Jun 12, 2026 10:153,52838,083,84526,872,0002,058,0002,113,536
9Jun 12, 2026 10:1513,581120,446,752109,350,0002,018,0002,113,536