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 20:39olliecrowolliecrowScore: 12,045Success
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 20:3912,024124,317,22597,593,0001,006,0002,478,080
2Mar 10, 2026 20:3912,045127,021,82796,777,0001,995,0002,445,312
3Mar 10, 2026 20:3912,050131,899,64697,811,000998,0002,498,560