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 listMay 24, 2025 07:48KeefeKeefeScore: 126,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2025 07:48102,696869,316,837700,259,000141,850,0002,445,312
2May 24, 2025 07:48126,4751,062,993,226893,218,000143,874,0002,416,640
3May 24, 2025 07:48137,6151,155,576,512990,513,000137,932,0002,281,472