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:50Eugene ZhydzetskiEugene ZhydzetskiScore: 21,323Success
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:5020,752191,854,966169,166,0001,000,0002,326,528
2Feb 26, 2025 05:5020,876197,507,060169,183,0002,002,0002,314,240
3Feb 26, 2025 05:5021,232205,163,697173,102,0001,000,0002,322,432
4Feb 26, 2025 05:5021,270200,886,778173,414,0001,002,0002,482,176
5Feb 26, 2025 05:5021,323206,959,107171,854,0002,997,0002,441,216
6Feb 26, 2025 05:5021,475196,373,541175,091,0001,000,0002,322,432
7Feb 26, 2025 05:5021,487206,829,868173,194,0003,003,0002,322,432
8Feb 26, 2025 05:5021,680206,754,375176,781,000998,0002,490,368
9Feb 26, 2025 05:5022,006209,806,036179,448,0001,002,0002,326,528