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 08:05Zhou180Zhou180Score: 21,797Success
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 08:053,52037,948,16727,825,0001,044,0002,117,632
2Jun 26, 2026 08:053,55538,340,10928,106,0001,051,0002,117,632
3Jun 26, 2026 08:0521,546185,807,558174,666,0002,012,0002,117,632
4Jun 26, 2026 08:0521,717187,250,427176,076,0002,011,0002,117,632
5Jun 26, 2026 08:0521,797187,940,204176,731,0002,012,0002,117,632
6Jun 26, 2026 08:0521,857189,837,976176,204,0003,029,0002,117,632
7Jun 26, 2026 08:0521,869188,482,540177,317,0002,011,0002,117,632
8Jun 26, 2026 08:0521,972189,319,996178,164,0002,013,0002,117,632
9Jun 26, 2026 08:0522,013189,639,323178,494,0002,016,0002,117,632