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:25Zhou180Zhou180Score: 21,617Success
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:253,46537,593,68727,358,0001,056,0002,117,632
2Jun 26, 2026 08:253,47337,632,34727,430,0001,055,0002,117,632
3Jun 26, 2026 08:253,49639,300,54127,641,0001,031,0002,117,632
4Jun 26, 2026 08:253,50037,846,87227,663,0001,038,0002,117,632
5Jun 26, 2026 08:2521,617186,812,843175,256,0002,011,0002,117,632
6Jun 26, 2026 08:2521,841188,275,150176,079,0003,024,0002,117,632
7Jun 26, 2026 08:2521,964189,353,261178,094,0002,012,0002,117,632
8Jun 26, 2026 08:2522,191191,061,184179,954,0002,013,0002,117,632
9Jun 26, 2026 08:2522,342192,335,726180,186,0003,019,0002,117,632