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 6, 2026 10:19Rajarshi BasuRajarshi BasuScore: 77,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 6, 2026 10:1969,812601,295,275451,571,000120,885,0002,318,336
2Jan 6, 2026 10:1977,752664,690,990514,652,000122,916,0002,482,176
3Jan 6, 2026 10:1986,951738,793,438602,156,000110,844,0002,404,352