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 9, 2025 05:34NoSIMD_C#NoSIMD_C#Score: 252,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2025 05:34247,5932,056,352,3171,921,306,000108,960,0002,523,136
2Apr 9, 2025 05:34252,0162,093,797,1301,951,610,000114,918,0002,273,280
3Apr 9, 2025 05:34328,2852,723,289,3122,581,019,000110,914,0002,527,232