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 6, 2025 09:55Aniruddha DebAniruddha DebScore: 5,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 09:555,76371,010,58544,243,0003,016,0002,334,720
2Jul 6, 2025 09:555,78871,446,10146,450,0001,009,0002,433,024
3Jul 6, 2025 09:555,83772,795,32446,868,000997,0002,523,136
4Jul 6, 2025 09:555,88265,343,01947,228,0001,004,0002,392,064
5Jul 6, 2025 09:555,90069,419,84847,371,0001,007,0002,408,448
6Jul 6, 2025 09:556,05472,212,85549,641,00002,473,984