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 listJan 15, 2025 06:58Ian MckibbenIan MckibbenScore: 48,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2025 06:5847,861417,960,341384,449,0008,009,0002,510,848
2Jan 15, 2025 06:5848,676427,198,743389,140,00010,003,0002,445,312
3Jan 15, 2025 06:5850,952442,619,486404,816,00012,994,0002,318,336