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 listFeb 26, 2025 05:54Eugene ZhydzetskiEugene ZhydzetskiScore: 21,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2025 05:5421,318204,319,548172,807,0001,997,0002,322,432
2Feb 26, 2025 05:5421,332200,540,329173,923,000999,0002,322,432
3Feb 26, 2025 05:5421,411201,611,498173,562,0002,006,0002,322,432
4Feb 26, 2025 05:5421,430204,094,576172,735,0002,995,0002,318,336
5Feb 26, 2025 05:5421,439199,639,469171,801,0003,995,0002,318,336
6Feb 26, 2025 05:5421,464204,753,616174,007,0002,000,0002,318,336
7Feb 26, 2025 05:5421,549204,538,511173,706,0002,994,0002,326,528
8Feb 26, 2025 05:5421,607199,782,022174,176,0003,003,0002,412,544
9Feb 26, 2025 05:5422,129202,659,504179,452,0002,005,0002,420,736