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 listApr 25, 2026 07:31limanjun99limanjun99Error
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 11:43Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 11:43011,457,59001,767,00020,480No answer to stdout. Died or killed?
2Apr 25, 2026 07:325,21559,870,85338,790,0003,978,0002,498,560
3Apr 25, 2026 07:325,25459,624,28440,083,0003,006,0002,326,528
4Apr 25, 2026 07:325,26661,741,47040,173,0003,013,0002,527,232
5Apr 25, 2026 07:325,32967,033,06142,686,0001,016,0002,445,312
6Apr 25, 2026 07:325,33960,026,44140,800,0002,985,0002,490,368
7Apr 25, 2026 07:325,40664,541,01841,314,0003,023,0002,437,120
8Apr 25, 2026 07:325,40862,580,50943,341,0001,007,0002,461,696
9Apr 25, 2026 07:325,41667,136,56842,397,0002,018,0002,490,368
10Apr 25, 2026 07:325,41860,975,01342,409,0002,019,0002,461,696