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 23, 2026 18:07Victor MerckléVictor MerckléScore: 2,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 18:082,88732,042,49622,653,0001,024,0002,117,632stderr
2Aug 23, 2026 18:082,89132,082,13422,682,0001,028,0002,117,632stderr
3Aug 23, 2026 18:082,89232,107,74922,693,0001,029,0002,117,632stderr
4Aug 23, 2026 18:082,90032,261,66922,758,0001,026,0002,117,632stderr
5Aug 23, 2026 18:082,90532,253,76422,799,0001,030,0002,117,632stderr
6Aug 23, 2026 18:082,90732,206,21222,810,0001,029,0002,117,632stderr
7Aug 23, 2026 18:085,54353,787,67344,438,0001,016,0002,117,632stderr
8Aug 23, 2026 18:085,57254,670,14244,673,0001,018,0002,117,632stderr
9Aug 23, 2026 18:085,58854,175,89344,811,0001,015,0002,117,632stderr