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:22Zhou180Zhou180Score: 3,652Success
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:233,58839,947,02328,372,0001,051,0002,117,632
2Jun 26, 2026 07:233,59138,886,08428,411,0001,041,0002,117,632
3Jun 26, 2026 07:233,60338,680,68327,498,0002,047,0002,117,632
4Jun 26, 2026 07:233,62838,945,20228,711,0001,039,0002,117,632
5Jun 26, 2026 07:233,65239,075,50828,915,0001,033,0002,117,632
6Jun 26, 2026 07:2321,958189,256,671177,051,0003,006,0002,117,632
7Jun 26, 2026 07:2322,200191,265,159179,030,0003,017,0002,117,632
8Jun 26, 2026 07:2322,356192,427,007180,316,0003,006,0002,117,632
9Jun 26, 2026 07:2323,109198,673,466186,493,0003,004,0002,117,632