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 31, 2025 15:38KeefeKeefeScore: 13,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2025 15:3813,019134,922,606104,763,0001,995,0002,330,624
2May 31, 2025 15:3813,020135,290,407104,766,0001,995,0002,330,624
3May 31, 2025 15:3813,043130,973,174104,957,0001,999,0002,289,664