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:20NoSIMD_C#NoSIMD_C#Score: 304,940Success
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:20160,8611,341,176,1721,211,138,000107,923,0002,510,848
2Apr 4, 2025 14:20304,9402,531,786,7722,399,570,000100,939,0002,301,952
3Apr 4, 2025 14:20514,5794,245,805,8174,093,620,000125,926,0002,424,832