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 23:57Ian MckibbenIan MckibbenScore: 19,093Success
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 23:5719,089185,698,104155,523,0001,003,0002,453,504
2Jan 15, 2025 23:5719,093181,490,008155,563,0001,003,0002,433,024
3Jan 15, 2025 23:5719,298187,316,435155,238,0003,004,0002,416,640