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 listJun 19, 2026 17:34Victor MerckléVictor MerckléScore: 3,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 17:353,33834,732,99526,326,0001,050,0002,113,536
2Jun 19, 2026 17:353,34236,485,59526,363,0001,048,0002,113,536
3Jun 19, 2026 17:353,34935,116,36526,405,0001,061,0002,113,536
4Jun 19, 2026 17:353,38135,116,44226,699,0001,032,0002,113,536
5Jun 19, 2026 17:353,39235,243,16326,756,0001,065,0002,113,536
6Jun 19, 2026 17:353,40535,352,96526,863,0001,061,0002,113,536
7Jun 19, 2026 17:353,41835,437,88527,003,0001,029,0002,113,536
8Jun 19, 2026 17:353,45835,870,12927,322,0001,035,0002,113,536
9Jun 19, 2026 17:356,31059,192,43750,731,0001,018,0002,113,536