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 listMar 14, 2026 21:30Elijah KinElijah KinScore: 65,404Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 21:3064,556560,256,220331,599,000197,761,0002,277,376
2Mar 14, 2026 21:3065,162560,691,628338,577,000195,755,0002,297,856
3Mar 14, 2026 21:3065,266567,967,673323,503,000211,675,0002,306,048
4Mar 14, 2026 21:3065,302562,612,584336,673,000198,806,0002,314,240
5Mar 14, 2026 21:3065,404566,503,157357,542,000178,771,0002,506,752
6Mar 14, 2026 21:3065,531572,041,994341,590,000195,765,0002,310,144
7Mar 14, 2026 21:3065,928565,171,601341,752,000198,855,0002,433,024
8Mar 14, 2026 21:3066,126574,056,997343,517,000198,720,0002,306,048
9Mar 14, 2026 21:3066,800577,668,900347,850,000199,914,0002,306,048