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 listMar 23, 2026 07:22Dominique GarmierDominique GarmierScore: 10,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 07:2210,119110,486,91181,975,000999,0002,502,656
2Mar 23, 2026 07:2210,268105,286,07982,193,0002,004,0002,428,928
3Mar 23, 2026 07:2210,336110,609,24083,762,000997,0002,347,008
4Mar 23, 2026 07:2210,338111,921,51980,783,0003,989,0002,445,312
5Mar 23, 2026 07:2210,378115,823,04882,093,0003,003,0002,293,760
6Mar 23, 2026 07:2210,389113,898,48181,181,0004,008,0002,428,928
7Mar 23, 2026 07:2210,421105,563,97184,451,0001,005,0002,367,488
8Mar 23, 2026 07:2210,434114,674,39585,558,00002,338,816
9Mar 23, 2026 07:2210,464109,334,23480,814,0004,988,0002,428,928