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 listJun 26, 2026 08:26Zhou180Zhou180Score: 3,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 08:273,79140,184,77930,046,0001,045,0002,117,632
2Jun 26, 2026 08:273,81040,529,70930,217,0001,027,0002,117,632
3Jun 26, 2026 08:273,82040,454,28430,299,0001,028,0002,117,632
4Jun 26, 2026 08:273,84740,759,82730,509,0001,043,0002,117,632
5Jun 26, 2026 08:273,85740,818,33930,592,0001,036,0002,117,632
6Jun 26, 2026 08:2722,156190,953,509179,671,0002,010,0002,117,632
7Jun 26, 2026 08:2722,415192,949,060180,799,0003,009,0002,117,632
8Jun 26, 2026 08:2722,439193,212,892181,993,0002,011,0002,117,632
9Jun 26, 2026 08:2722,729195,586,620184,368,0002,011,0002,117,632