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:22Zhou180Zhou180Score: 21,903Success
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:233,47037,579,24727,412,0001,047,0002,117,632
2Jun 26, 2026 08:233,47337,605,86827,418,0001,065,0002,117,632
3Jun 26, 2026 08:233,48637,781,48227,524,0001,062,0002,117,632
4Jun 26, 2026 08:233,52438,201,90527,828,0001,071,0002,117,632
5Jun 26, 2026 08:2321,903188,756,639177,596,0002,012,0002,117,632
6Jun 26, 2026 08:2321,929188,929,132177,810,0002,012,0002,117,632
7Jun 26, 2026 08:2321,931189,040,345176,800,0003,037,0002,117,632
8Jun 26, 2026 08:2321,995189,472,955178,348,0002,011,0002,117,632
9Jun 26, 2026 08:2322,129191,977,195178,425,0003,035,0002,117,632