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 listNov 28, 2024 16:15NoSIMD_C#NoSIMD_C#Score: 1,950,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 28, 2024 16:151,886,26715,500,864,99615,351,465,000115,928,0002,326,528
2Nov 28, 2024 16:151,950,22116,024,551,57715,875,885,000115,926,0002,334,720
3Nov 28, 2024 16:151,989,73616,347,871,82216,197,903,000117,933,0002,326,528