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 24, 2025 02:01KeefeKeefeScore: 61,055Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2025 02:0160,086519,376,166318,807,000173,895,0002,502,656
2Apr 24, 2025 02:0161,055524,799,586323,777,000176,878,0002,330,624
3Apr 24, 2025 02:0161,490528,940,592332,484,000171,733,0002,412,544