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 21, 2026 20:25Dominique GarmierDominique GarmierScore: 14,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 20:2513,995140,743,842112,766,0001,995,0002,396,160
2Mar 21, 2026 20:2514,000144,125,766113,799,000998,0002,387,968
3Mar 21, 2026 20:2514,031142,755,955114,051,0001,000,0002,441,216