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 25, 2026 06:47Dominique GarmierDominique GarmierScore: 15,755Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 06:4715,754152,225,477126,182,0003,004,0002,396,160
2Mar 25, 2026 06:4715,755153,749,996127,186,0002,002,0002,437,120
3Mar 25, 2026 06:4715,823163,854,731127,755,0001,996,0002,310,144