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 23, 2026 16:42Victor MerckléVictor MerckléScore: 3,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 16:423,14735,367,75824,785,0001,025,0002,113,536
2Jun 23, 2026 16:423,15233,207,98124,824,0001,027,0002,113,536
3Jun 23, 2026 16:423,20133,710,36225,224,0001,028,0002,113,536
4Jun 23, 2026 16:423,24534,261,99525,587,0001,028,0002,113,536
5Jun 23, 2026 16:423,25134,112,83625,633,0001,028,0002,113,536
6Jun 23, 2026 16:423,26034,202,17725,715,0001,023,0002,113,536
7Jun 23, 2026 16:423,26134,409,98625,718,0001,025,0002,113,536
8Jun 23, 2026 16:423,28334,315,99425,899,0001,023,0002,113,536
9Jun 23, 2026 16:4212,093106,639,76498,163,0001,007,0002,113,536