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 20:23Ian MckibbenIan MckibbenScore: 167,460Success
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 20:2057,280492,412,277467,694,0001,998,0002,363,392
2Jan 15, 2025 20:2057,320494,073,919468,026,0002,000,0002,351,104
3Jan 15, 2025 20:2058,142501,787,926474,766,0001,999,0002,359,296
4Jan 15, 2025 20:23167,4601,397,355,0811,363,189,0009,986,0002,482,176
5Jan 15, 2025 20:23168,5331,415,677,5671,370,990,00010,983,0002,269,184
6Jan 15, 2025 20:23169,9831,421,245,6311,384,868,0008,992,0002,273,280