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 05:16Josu San MartinJosu San MartinScore: 10,758Success
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 05:1610,743114,114,89185,090,0003,003,0002,539,520
2Jan 18, 2026 05:1610,758115,145,23286,213,0002,004,0002,572,288
3Jan 18, 2026 05:1610,761114,220,67587,235,0001,002,0002,469,888