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 listJul 2, 2026 14:17A_ShamanA_ShamanScore: 14,301Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 14:1814,192125,698,194114,339,0002,037,0002,113,536
2Jul 2, 2026 14:1814,242126,077,755114,603,0002,182,0002,113,536
3Jul 2, 2026 14:1814,261126,274,065114,762,0002,186,0002,113,536
4Jul 2, 2026 14:1814,275126,352,217114,851,0002,204,0002,113,536
5Jul 2, 2026 14:1814,301126,589,361115,262,0002,014,0002,113,536
6Jul 2, 2026 14:1814,326126,935,194115,440,0002,035,0002,113,536
7Jul 2, 2026 14:1814,372127,239,699115,555,0002,299,0002,113,536
8Jul 2, 2026 14:1814,459127,969,914116,359,0002,208,0002,113,536
9Jul 2, 2026 14:1814,469127,912,039116,627,0002,026,0002,113,536