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 24, 2026 05:27Dominique GarmierDominique GarmierScore: 10,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 05:279,996105,660,72578,966,0002,998,0002,265,088
2Mar 24, 2026 05:2710,003115,019,74879,023,0003,000,0002,322,432
3Mar 24, 2026 05:2710,070113,890,14380,558,0002,013,0002,322,432