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 25, 2026 14:39Elijah KinElijah KinScore: 65,148Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 14:4064,673539,738,978379,091,000151,235,0002,113,536
2May 25, 2026 14:4064,931543,683,629380,246,000152,194,0002,113,536
3May 25, 2026 14:4064,996543,136,042382,558,000150,412,0002,113,536
4May 25, 2026 14:4065,110544,676,217382,635,000151,274,0002,113,536
5May 25, 2026 14:4065,148545,237,587384,581,000149,635,0002,113,536
6May 25, 2026 14:4065,460547,656,786380,640,000156,136,0002,113,536
7May 25, 2026 14:4065,491546,386,478380,135,000156,899,0002,113,536
8May 25, 2026 14:4065,665549,256,000381,616,000156,838,0002,113,536
9May 25, 2026 14:4066,717559,728,806396,084,000150,998,0002,113,536