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 29, 2026 20:17Dominique GarmierDominique GarmierScore: 154,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 20:17154,8091,298,079,6111,268,431,000999,0002,482,176
2Mar 29, 2026 20:17154,9121,299,289,3871,269,276,000999,0002,375,680
3Mar 29, 2026 20:17155,0521,295,667,0181,269,425,0001,999,0002,482,176