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 10, 2026 22:08olliecrowolliecrowScore: 3,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 22:083,61760,545,75327,617,0002,045,0002,441,216
2Mar 10, 2026 22:083,64160,746,38427,867,0001,990,0002,449,408
3Mar 10, 2026 22:0818,572174,715,189149,288,0003,005,0002,457,600