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:26olliecrowolliecrowScore: 18,328Success
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:263,41851,648,90826,029,0002,002,0002,490,368
2Mar 10, 2026 22:2618,328175,009,642145,278,0005,009,0002,494,464
3Mar 10, 2026 22:2618,387180,159,609145,785,0004,992,0002,375,680