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 listAug 19, 2026 16:17Victor MerckléVictor MerckléScore: 5,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 16:212,76330,991,28621,651,0001,013,0002,117,632stderr
2Aug 19, 2026 16:212,76831,692,63021,682,0001,019,0002,117,632stderr
3Aug 19, 2026 16:215,37052,122,04542,988,0001,046,0002,117,632stderr
4Aug 19, 2026 16:215,39252,322,46243,179,0001,038,0002,117,632stderr
5Aug 19, 2026 16:215,44353,583,32543,503,0001,132,0002,117,632stderr
6Aug 19, 2026 16:215,44352,751,30943,596,0001,043,0002,117,632stderr
7Aug 19, 2026 16:215,44452,781,02643,483,0001,158,0002,117,632stderr
8Aug 19, 2026 16:215,44753,658,34843,539,0001,132,0002,117,632stderr
9Aug 19, 2026 16:215,46152,899,03143,693,0001,090,0002,117,632stderr