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 09:21Ian MckibbenIan MckibbenScore: 82,982Success
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 09:2179,589680,964,795424,757,000227,869,0002,379,776
2Jan 9, 2025 09:2179,723682,027,139433,822,000219,909,0002,306,048
3Jan 9, 2025 09:2181,853703,441,504449,462,000221,734,0002,502,656
4Jan 9, 2025 09:2182,710704,444,791464,465,000213,754,0002,445,312
5Jan 9, 2025 09:2182,982703,833,421471,619,000208,831,0002,424,832
6Jan 9, 2025 09:2184,330718,533,528467,665,000223,840,0002,482,176
7Jan 9, 2025 09:2187,215738,597,454479,442,000235,725,0002,314,240
8Jan 9, 2025 09:2187,580748,613,052489,426,000228,731,0002,457,600
9Jan 9, 2025 09:2187,761749,901,522496,752,000222,888,0002,351,104