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 listJan 9, 2025 08:04Ian MckibbenIan MckibbenScore: 103,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 08:0480,770688,658,960466,518,000195,798,0002,306,048
2Jan 9, 2025 08:0482,050694,844,162479,863,000192,944,0002,310,144
3Jan 9, 2025 08:0483,670715,836,412494,346,000191,746,0002,310,144
4Jan 9, 2025 08:04102,668869,094,597648,907,000192,972,0002,396,160
5Jan 9, 2025 08:04103,613873,680,279652,713,000196,913,0002,281,472
6Jan 9, 2025 08:04109,013921,549,166699,929,000193,980,0002,306,048
7Jan 9, 2025 08:04109,939928,562,835706,607,000194,891,0002,306,048
8Jan 9, 2025 08:04110,330931,505,407713,766,000190,937,0002,322,432
9Jan 9, 2025 08:04126,9761,066,171,424854,346,000186,857,0002,510,848