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 15:14Victor MerckléVictor MerckléScore: 2,796Success
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 15:152,74630,799,68421,443,0001,082,0002,117,632stderr
2Aug 19, 2026 15:152,75731,083,51821,507,0001,103,0002,117,632stderr
3Aug 19, 2026 15:152,77031,037,79021,695,0001,027,0002,117,632stderr
4Aug 19, 2026 15:152,79431,171,74621,875,0001,037,0002,117,632stderr
5Aug 19, 2026 15:152,79632,043,58821,901,0001,027,0002,117,632stderr
6Aug 19, 2026 15:155,45153,660,76243,582,0001,123,0002,117,632stderr
7Aug 19, 2026 15:155,47253,837,53943,736,0001,138,0002,117,632stderr
8Aug 19, 2026 15:155,48554,057,69043,843,0001,137,0002,117,632stderr
9Aug 19, 2026 15:155,49353,975,66843,905,0001,144,0002,117,632stderr