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 09:50Victor MerckléVictor MerckléScore: 5,457Success
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:542,86031,669,50522,433,0001,027,0002,117,632stderr
2Aug 19, 2026 09:542,89031,884,07322,685,0001,019,0002,117,632stderr
3Aug 19, 2026 09:545,41452,493,96243,371,0001,031,0002,117,632stderr
4Aug 19, 2026 09:545,43354,048,07643,507,0001,047,0002,117,632stderr
5Aug 19, 2026 09:545,45752,880,08243,713,0001,037,0002,117,632stderr
6Aug 19, 2026 09:545,47853,147,52743,800,0001,120,0002,117,632stderr
7Aug 19, 2026 09:545,49453,327,51943,989,0001,066,0002,117,632stderr
8Aug 19, 2026 09:545,52054,302,85844,116,0001,153,0002,117,632stderr
9Aug 19, 2026 09:5429,774252,313,168243,034,0001,113,0002,117,632stderr