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 15, 2025 20:23Ian MckibbenIan MckibbenScore: 167,511Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2025 20:2157,191492,943,195466,970,0001,999,0002,461,696
2Jan 15, 2025 20:2157,900499,289,660472,782,0001,999,0002,457,600
3Jan 15, 2025 20:2157,950501,742,290473,193,0002,000,0002,277,376
4Jan 15, 2025 20:23167,5111,398,648,2341,364,595,0008,997,0002,498,560
5Jan 15, 2025 20:23168,4881,409,946,2571,372,610,0008,990,0002,506,752
6Jan 15, 2025 20:23169,6691,414,784,3041,381,290,0009,994,0002,338,816