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 14:28Victor MerckléVictor MerckléScore: 2,913Success
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 14:292,83231,483,15222,202,0001,022,0002,117,632stderr
2Aug 19, 2026 14:292,84831,645,33422,222,0001,132,0002,117,632stderr
3Aug 19, 2026 14:292,85631,558,59422,255,0001,170,0002,117,632stderr
4Aug 19, 2026 14:292,89332,799,45722,613,0001,112,0002,117,632stderr
5Aug 19, 2026 14:292,91332,066,52222,650,0001,240,0002,117,632stderr
6Aug 19, 2026 14:292,93433,128,61622,948,0001,113,0002,117,632stderr
7Aug 19, 2026 14:295,47253,972,12543,592,0001,279,0002,117,632stderr
8Aug 19, 2026 14:295,50353,353,02144,005,0001,126,0002,117,632stderr
9Aug 19, 2026 14:295,55654,616,51644,546,0001,016,0002,117,632stderr