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 19, 2026 17:28Victor MerckléVictor MerckléScore: 3,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 17:283,32435,022,33226,217,0001,043,0002,113,536
2Jun 19, 2026 17:283,34934,999,02826,416,0001,047,0002,113,536
3Jun 19, 2026 17:283,35634,972,04926,461,0001,064,0002,113,536
4Jun 19, 2026 17:283,37034,998,09426,580,0001,061,0002,113,536
5Jun 19, 2026 17:283,37935,426,88526,649,0001,061,0002,113,536
6Jun 19, 2026 17:283,41135,668,99926,944,0001,034,0002,113,536
7Jun 19, 2026 17:283,41335,412,35426,932,0001,058,0002,113,536
8Jun 19, 2026 17:283,41535,593,25226,941,0001,066,0002,113,536
9Jun 19, 2026 17:283,43935,588,74127,164,0001,040,0002,113,536