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:22olliecrowolliecrowScore: 21,478Success
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:223,32250,082,06025,223,0002,017,0002,322,432
2Mar 20, 2026 14:2221,478197,696,888172,121,0004,002,0002,277,376
3Mar 20, 2026 14:2221,644200,844,462174,469,0003,008,0002,363,392