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 15:43NoSIMD_C#NoSIMD_C#Score: 249,967Success
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 15:43247,7152,061,856,4411,920,307,000110,959,0002,482,176
2Apr 4, 2025 15:43249,9672,077,200,8571,946,791,000102,936,0002,473,984
3Apr 4, 2025 15:43267,6952,229,460,4612,077,146,000117,951,0002,469,888