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 listJan 8, 2026 06:58Rajarshi BasuRajarshi BasuScore: 74,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 06:586,00576,922,06345,219,0004,019,0002,465,792
2Jan 8, 2026 06:5874,124634,363,949481,854,000125,961,0002,514,944
3Jan 8, 2026 06:5879,429681,016,296529,443,000121,871,0002,396,160