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 listMay 10, 2026 10:17Pavel SkripkinPavel SkripkinScore: 24,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:193,84648,276,51429,459,0002,081,0002,502,656
2May 10, 2026 10:193,90147,811,22829,906,0002,083,0002,387,968
3May 10, 2026 10:193,91344,766,20830,014,0002,079,0002,424,832
4May 10, 2026 10:193,92146,952,15430,068,0002,087,0002,396,160
5May 10, 2026 10:1924,414213,585,732198,186,0002,016,0002,396,160
6May 10, 2026 10:1924,846218,900,246201,726,0002,013,0002,310,144
7May 10, 2026 10:1924,852221,787,013201,506,0002,283,0002,334,720
8May 10, 2026 10:1925,038223,010,765203,302,0002,012,0002,445,312
9May 10, 2026 10:1925,312224,799,626205,546,0002,013,0002,523,136