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 08:56Victor MerckléVictor MerckléScore: 2,954Success
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 09:032,90532,166,45322,689,0001,133,0002,117,632stderr
2Aug 19, 2026 09:032,90933,398,40922,735,0001,119,0002,117,632stderr
3Aug 19, 2026 09:032,92732,999,97122,880,0001,122,0002,117,632stderr
4Aug 19, 2026 09:032,94932,463,73223,070,0001,118,0002,117,632stderr
5Aug 19, 2026 09:032,95433,245,22423,053,0001,176,0002,117,632stderr
6Aug 19, 2026 09:032,98032,809,35023,309,0001,132,0002,117,632stderr
7Aug 19, 2026 09:032,99233,612,17923,404,0001,136,0002,117,632stderr
8Aug 19, 2026 09:035,48553,262,56343,884,0001,096,0002,117,632stderr
9Aug 19, 2026 09:035,62354,412,14245,096,0001,015,0002,117,632stderr