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:17Zhou180Zhou180Score: 3,637Success
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:183,59738,710,88428,432,0001,067,0002,117,632
2Jun 26, 2026 07:183,60238,786,67228,501,0001,040,0002,117,632
3Jun 26, 2026 07:183,60538,691,67028,504,0001,064,0002,117,632
4Jun 26, 2026 07:183,63538,975,22928,782,0001,033,0002,117,632
5Jun 26, 2026 07:183,63739,026,22428,796,0001,032,0002,117,632
6Jun 26, 2026 07:1821,520185,708,547173,449,0003,021,0002,117,632
7Jun 26, 2026 07:1821,867188,505,138176,299,0003,016,0002,117,632
8Jun 26, 2026 07:1821,907188,874,505177,631,0002,013,0002,117,632
9Jun 26, 2026 07:1822,359192,528,674180,340,0003,008,0002,117,632