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 listJan 8, 2026 08:18Rajarshi BasuRajarshi BasuScore: 74,681Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 08:1870,492604,598,384444,028,000134,008,0002,293,760
2Jan 8, 2026 08:1874,681643,501,007488,509,000123,875,0002,285,568
3Jan 8, 2026 08:1886,257734,731,422593,421,000113,889,0002,285,568