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:03NoSIMD_C#NoSIMD_C#Error
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:0100000Error: expected "2202410486 ", got "2190433218 "
2Apr 4, 2025 15:03215,0861,795,076,1931,648,789,000114,915,0002,535,424
3Apr 4, 2025 15:03267,7852,220,384,1472,102,886,00092,950,0002,314,240
4Apr 4, 2025 15:03313,2382,599,971,9532,452,614,000115,934,0002,375,680