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 26, 2026 07:44Zhou180Zhou180Score: 21,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 07:443,53738,148,47127,954,0001,055,0002,117,632
2Jun 26, 2026 07:443,57238,450,17028,240,0001,053,0002,117,632
3Jun 26, 2026 07:443,61338,800,30128,564,0001,063,0002,117,632
4Jun 26, 2026 07:4421,297183,883,276171,611,0003,031,0002,117,632
5Jun 26, 2026 07:4421,582186,137,166174,965,0002,010,0002,117,632
6Jun 26, 2026 07:4421,603186,373,564175,135,0002,011,0002,117,632
7Jun 26, 2026 07:4421,769187,740,160176,500,0002,011,0002,117,632
8Jun 26, 2026 07:4421,938189,145,319177,885,0002,012,0002,117,632
9Jun 26, 2026 07:4422,091190,315,874179,140,0002,010,0002,117,632