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 18, 2026 06:37Josu San MartinJosu San MartinScore: 14,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 06:3714,779150,382,263120,188,0001,001,0002,514,944
2Jan 18, 2026 06:3714,824146,601,449121,557,00002,277,376
3Jan 18, 2026 06:3714,951153,409,610122,600,00002,527,232