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 listDec 26, 2025 03:34Josu San MartinJosu San MartinScore: 14,185Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 03:3114,131143,052,386112,875,0002,996,0002,277,376
2Dec 26, 2025 03:3114,151143,090,733114,042,0002,000,0002,330,624
3Dec 26, 2025 03:3114,158140,847,438114,094,0002,001,0002,322,432
4Dec 26, 2025 03:3114,169143,915,502112,176,0004,006,0002,314,240
5Dec 26, 2025 03:3114,173140,361,395114,215,0002,003,0002,277,376
6Dec 26, 2025 03:3414,181143,837,779113,274,0003,007,0002,318,336
7Dec 26, 2025 03:3414,185136,435,364114,315,0002,005,0002,461,696
8Dec 26, 2025 03:3114,191141,064,546114,360,0002,006,0002,326,528
9Dec 26, 2025 03:3114,193141,889,739114,374,0002,006,0002,318,336
10Dec 26, 2025 03:3414,202142,332,649116,453,00002,314,240
11Dec 26, 2025 03:3114,207142,254,915115,494,0001,004,0002,301,952
12Dec 26, 2025 03:3114,209145,235,070116,510,00002,277,376