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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 15:082,83531,534,20122,223,0001,025,0002,117,632stderr
2Aug 18, 2026 15:082,83632,311,60822,248,0001,015,0002,117,632stderr
3Aug 18, 2026 15:082,84031,506,21022,274,0001,016,0002,117,632stderr
4Aug 18, 2026 15:082,84232,364,54022,292,0001,016,0002,117,632stderr
5Aug 18, 2026 15:082,85832,136,34122,424,0001,019,0002,117,632stderr
6Aug 18, 2026 15:082,86332,482,12622,453,0001,027,0002,117,632stderr
7Aug 18, 2026 15:082,88931,875,81722,666,0001,024,0002,117,632stderr
8Aug 18, 2026 15:085,47753,161,56343,792,0001,124,0002,117,632stderr
9Aug 18, 2026 15:085,85963,707,37446,791,0001,256,0002,117,632stderr