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 20, 2026 14:03olliecrowolliecrowScore: 3,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 14:033,27655,560,08424,871,0001,989,0002,297,856
2Mar 20, 2026 14:033,27653,024,37124,876,0001,990,0002,367,488
3Mar 20, 2026 14:0321,232201,322,197171,104,0003,001,0002,523,136