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 listJan 19, 2025 00:57Ian MckibbenIan MckibbenScore: 13,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 00:5513,873140,815,461112,762,000997,0002,445,312
2Jan 19, 2025 00:5713,875142,310,997112,777,000998,0002,326,528
3Jan 19, 2025 00:5713,898135,329,811112,964,000999,0002,424,832
4Jan 19, 2025 00:5513,902142,965,899112,999,000999,0002,314,240
5Jan 19, 2025 00:5713,903136,805,883113,008,0001,000,0002,408,448
6Jan 19, 2025 00:5713,906142,524,656113,026,0001,000,0002,306,048
7Jan 19, 2025 00:5713,909136,734,693113,055,0001,000,0002,306,048
8Jan 19, 2025 00:5713,930135,397,247113,221,0001,001,0002,445,312
9Jan 19, 2025 00:5513,933151,072,684113,252,0001,002,0002,510,848