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 12, 2026 11:03Victor MerckléVictor MerckléScore: 3,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 11:033,35535,027,59226,460,0001,054,0002,113,536
2Jun 12, 2026 11:033,36134,980,11226,506,0001,055,0002,113,536
3Jun 12, 2026 11:033,37035,240,32326,607,0001,031,0002,113,536
4Jun 12, 2026 11:033,38135,266,38926,659,0001,067,0002,113,536
5Jun 12, 2026 11:033,40335,455,05526,879,0001,031,0002,113,536
6Jun 12, 2026 11:033,41735,645,63926,981,0001,044,0002,113,536
7Jun 12, 2026 11:033,42935,518,11527,065,0001,058,0002,113,536
8Jun 12, 2026 11:033,45635,893,05027,276,0001,067,0002,113,536
9Jun 12, 2026 11:0312,754112,034,881102,408,0002,179,0002,113,536