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 listMay 25, 2026 14:47Elijah KinElijah KinScore: 76,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 14:4875,402630,060,726467,490,000150,808,0002,113,536
2May 25, 2026 14:4875,689633,600,227469,613,000151,042,0002,113,536
3May 25, 2026 14:4876,143636,284,049467,965,000156,410,0002,113,536
4May 25, 2026 14:4876,170633,923,563467,769,000156,831,0002,113,536
5May 25, 2026 14:4876,708640,900,880476,623,000152,388,0002,113,536
6May 25, 2026 14:4876,717639,744,599476,219,000152,865,0002,113,536
7May 25, 2026 14:4876,860642,647,713479,563,000150,695,0002,113,536
8May 25, 2026 14:4877,427646,664,109483,768,000151,139,0002,113,536
9May 25, 2026 14:4877,979651,208,096483,394,000156,041,0002,113,536