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 06:11NoSIMD_C#NoSIMD_C#Score: 280,490Success
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 06:11147,6211,237,262,9431,108,533,000101,957,0002,457,600
2Apr 9, 2025 06:11280,4902,326,945,7282,172,126,000127,889,0002,326,528
3Apr 9, 2025 06:11291,1442,412,138,7682,264,461,000122,916,0002,555,904