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 14:26NoSIMD_C#NoSIMD_C#Score: 324,068Success
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 14:26320,9792,661,795,6082,527,105,000104,921,0002,265,088
2Apr 4, 2025 14:26324,0682,681,820,3652,546,426,000110,931,0002,342,912
3Apr 4, 2025 14:26329,8122,730,569,5602,605,517,00098,943,0002,514,944