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 listMar 20, 2026 02:59olliecrowolliecrowScore: 18,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 02:5918,292178,999,392147,992,0001,999,0002,473,984
2Mar 20, 2026 02:5918,330172,907,101146,300,0004,008,0002,457,600
3Mar 20, 2026 02:5918,413174,971,000147,990,0002,999,0002,445,312