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 listApr 18, 2026 19:20Charles CabergsCharles CabergsScore: 11,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 19:2011,344119,734,40192,021,0001,000,0002,437,120
2Apr 18, 2026 19:2011,361115,599,14490,158,0003,005,0002,396,160
3Apr 18, 2026 19:2011,366121,343,33990,199,0003,006,0002,330,624
4Apr 18, 2026 19:2011,379121,991,77390,300,0003,010,0002,355,200
5Apr 18, 2026 19:2011,397116,614,01592,454,0001,004,0002,273,280
6Apr 18, 2026 19:2011,412126,390,98192,576,0001,006,0002,506,752
7Apr 18, 2026 19:2011,434121,113,03687,771,0005,984,0002,318,336
8Apr 18, 2026 19:2011,437127,069,49091,791,0001,995,0002,469,888
9Apr 18, 2026 19:2011,438123,137,19490,795,0002,993,0002,301,952