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 4, 2026 02:29olliecrowolliecrowScore: 15,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 02:2911,084120,495,87886,892,0003,995,0002,490,368
2Mar 4, 2026 02:2915,626153,529,827123,132,0005,005,0002,375,680
3Mar 4, 2026 02:2915,839167,425,812126,879,0002,997,0002,424,832