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 06:51Zhou180Zhou180Score: 3,918Success
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 06:513,86942,668,92129,506,0002,223,0002,117,632
2Jun 26, 2026 06:513,87741,382,43329,568,0002,230,0002,117,632
3Jun 26, 2026 06:513,88141,022,93829,685,0002,145,0002,117,632
4Jun 26, 2026 06:513,89041,112,78129,861,0002,045,0002,117,632
5Jun 26, 2026 06:513,91841,717,01029,885,0002,243,0002,117,632
6Jun 26, 2026 06:513,93941,942,67530,060,0002,242,0002,117,632
7Jun 26, 2026 06:513,96142,140,33130,204,0002,279,0002,117,632
8Jun 26, 2026 06:5122,184191,352,615178,534,0003,378,0002,117,632
9Jun 26, 2026 06:5122,976197,923,997185,121,0003,290,0002,117,632