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 07:48Zhou180Zhou180Score: 21,556Success
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 07:493,50538,102,33127,701,0001,045,0002,117,632
2Jun 26, 2026 07:493,57138,452,92828,238,0001,052,0002,117,632
3Jun 26, 2026 07:493,67539,319,48028,102,0002,041,0002,117,632
4Jun 26, 2026 07:4921,106182,258,649171,060,0002,013,0002,117,632
5Jun 26, 2026 07:4921,556185,900,923174,748,0002,012,0002,117,632
6Jun 26, 2026 07:4921,584186,385,676174,981,0002,012,0002,117,632
7Jun 26, 2026 07:4921,587186,148,417175,007,0002,012,0002,117,632
8Jun 26, 2026 07:4922,000189,632,167178,393,0002,012,0002,117,632
9Jun 26, 2026 07:4922,025189,746,116178,601,0002,012,0002,117,632