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 listMar 14, 2026 21:53Elijah KinElijah KinScore: 142,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 21:53141,9891,192,476,116971,592,000192,720,0002,293,760
2Mar 14, 2026 21:53142,9641,199,907,054974,591,000197,714,0002,277,376
3Mar 14, 2026 21:53143,4681,207,549,767982,698,000193,743,0002,277,376