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 listOct 9, 2026 21:56highload-churnerhighload-churnerScore: 3,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 22:543,50737,712,65127,694,0001,071,00024,576
2Oct 9, 2026 22:543,52744,536,14327,897,0001,028,00024,576
3Oct 9, 2026 22:543,53137,813,88926,836,0002,120,00024,576
4Oct 9, 2026 22:543,56438,190,75328,193,0001,035,00024,576
5Oct 9, 2026 22:543,61438,608,60727,605,0002,033,00024,576
6Oct 9, 2026 22:543,62038,679,72327,677,0002,012,00024,576
7Oct 9, 2026 22:543,62138,587,58528,662,0001,033,00024,576
8Oct 9, 2026 22:543,66739,057,16328,039,0002,032,00024,576
9Oct 9, 2026 22:543,68139,175,85528,161,0002,031,00024,576