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 7, 2025 08:39KeefeKeefeScore: 13,175Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2025 08:3913,168130,752,011104,976,0002,999,0002,408,448
2May 7, 2025 08:3913,175127,567,584107,037,0001,000,0002,404,352
3May 7, 2025 08:3913,182134,215,719107,089,0001,000,0002,412,544