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 14, 2026 04:39Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 12:25Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:25016,176,0584,525,0002,239,00024,576No answer to stdout. Died or killed?stderr
2Apr 14, 2026 04:393,06849,801,70824,150,0001,006,0002,306,048
3Apr 14, 2026 04:393,08049,725,37822,224,0003,030,0002,449,408
4Apr 14, 2026 04:393,11649,111,74524,532,0001,022,0002,420,736
5Apr 14, 2026 04:393,11752,732,13922,491,0003,066,0002,355,200
6Apr 14, 2026 04:393,11946,263,96624,551,0001,022,0002,322,432
7Apr 14, 2026 04:393,15153,745,79223,851,0001,987,0002,297,856
8Apr 14, 2026 04:393,15150,462,91023,854,0001,987,0002,523,136
9Apr 14, 2026 04:393,15251,925,75222,867,0002,982,0002,314,240
10Apr 14, 2026 04:393,15453,264,32223,874,0001,989,0002,502,656