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 15:23NoSIMD_C#NoSIMD_C#Score: 323,058Success
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 15:23283,0222,350,322,1852,210,839,000109,942,0002,322,432
2Apr 4, 2025 15:23323,0582,678,027,8472,531,160,000117,914,0002,306,048
3Apr 4, 2025 15:23364,9963,017,177,1092,879,042,000113,922,0002,314,240