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 listApr 4, 2025 14:15NoSIMD_C#NoSIMD_C#Score: 270,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2025 14:15192,7741,606,305,0981,456,843,000123,901,0002,363,392
2Apr 4, 2025 14:15244,5952,033,393,1071,883,761,000121,919,0002,359,296
3Apr 4, 2025 14:15249,7592,072,677,9601,927,078,000120,942,0002,326,528
4Apr 4, 2025 14:15259,4752,155,876,6232,016,766,000110,932,0002,326,528
5Apr 4, 2025 14:15270,6702,245,803,7462,098,577,000120,918,0002,478,080
6Apr 4, 2025 14:15292,4712,421,282,9932,302,336,00095,930,0002,281,472
7Apr 4, 2025 14:15299,9482,488,291,4102,329,650,000129,924,0002,355,200
8Apr 4, 2025 14:15424,7233,508,392,2323,358,808,000123,919,0002,453,504
9Apr 4, 2025 14:15435,6543,601,854,2913,469,408,000102,952,0002,293,760