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 16:17NoSIMD_C#NoSIMD_C#Score: 277,232Success
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 16:17245,0612,033,989,8711,892,590,000116,912,0002,445,312
2Apr 4, 2025 16:17277,2322,308,412,9032,151,391,000121,908,0002,445,312
3Apr 4, 2025 16:17427,9053,533,640,8283,384,898,000123,923,0002,437,120