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 06:38olliecrowolliecrowScore: 12,283Success
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 06:3812,270131,494,43597,594,0003,018,0002,461,696
2Mar 4, 2026 06:3812,283127,252,05195,731,0004,986,0002,281,472
3Mar 4, 2026 06:3812,293124,695,88699,804,000998,0002,486,272