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 22, 2025 10:48NoSIMD_C#NoSIMD_C#Score: 370,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 10:48281,4822,332,920,8862,236,207,00071,942,0002,412,544
2Apr 22, 2025 10:48370,6223,066,383,3762,969,146,00069,956,0002,289,664
3Apr 22, 2025 10:48380,5013,146,290,9403,056,145,00063,961,0002,404,352