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 25, 2026 15:28Zhou180Zhou180Score: 25,099Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 15:2924,491210,004,896195,928,0004,901,0002,117,632
2Jun 25, 2026 15:2924,603210,913,237196,981,0004,769,0002,117,632
3Jun 25, 2026 15:2924,621211,047,345197,278,0004,618,0002,117,632
4Jun 25, 2026 15:2924,921213,541,464199,684,0004,676,0002,117,632
5Jun 25, 2026 15:2925,099214,993,068201,031,0004,782,0002,117,632
6Jun 25, 2026 15:2925,187215,684,043201,757,0004,779,0002,117,632
7Jun 25, 2026 15:2925,199215,799,447201,821,0004,815,0002,117,632
8Jun 25, 2026 15:2925,222215,945,651202,116,0004,708,0002,117,632
9Jun 25, 2026 15:2925,697219,960,440205,493,0005,226,0002,117,632