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:19NoSIMD_C#NoSIMD_C#Score: 256,231Success
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:19227,2811,886,588,2401,768,772,00094,934,0002,355,200
2Apr 9, 2025 05:19256,2312,128,974,9761,996,143,000104,954,0002,502,656
3Apr 9, 2025 05:19339,1612,807,646,1122,675,194,000105,928,0002,326,528