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 23, 2026 21:34Victor MerckléVictor MerckléScore: 3,133Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 21:353,06332,732,13424,101,0001,021,0002,113,536
2Jun 23, 2026 21:353,09133,012,24524,326,0001,026,0002,113,536
3Jun 23, 2026 21:353,10633,177,97824,447,0001,028,0002,113,536
4Jun 23, 2026 21:353,12633,312,27424,614,0001,027,0002,113,536
5Jun 23, 2026 21:353,13333,368,79724,412,0001,285,0002,113,536
6Jun 23, 2026 21:353,13833,258,53424,488,0001,245,0002,113,536
7Jun 23, 2026 21:3512,682111,618,248102,985,0001,010,0002,113,536
8Jun 23, 2026 21:3512,726111,964,970103,350,0001,008,0002,113,536
9Jun 23, 2026 21:3512,790112,497,886103,863,0001,020,0002,113,536