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:51Victor MerckléVictor MerckléScore: 5,531Success
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:522,80131,079,54321,926,0001,047,0002,117,632stderr
2Aug 19, 2026 14:522,81631,453,14221,985,0001,109,0002,117,632stderr
3Aug 19, 2026 14:522,87431,771,31222,368,0001,200,0002,117,632stderr
4Aug 19, 2026 14:525,52053,621,01444,251,0001,019,0002,117,632stderr
5Aug 19, 2026 14:525,53153,762,42544,337,0001,018,0002,117,632stderr
6Aug 19, 2026 14:525,56453,861,15144,608,0001,019,0002,117,632stderr
7Aug 19, 2026 14:525,59254,891,87443,819,0002,042,0002,117,632stderr
8Aug 19, 2026 14:525,65554,773,46345,355,0001,020,0002,117,632stderr
9Aug 19, 2026 14:525,69554,851,83845,684,0001,017,0002,117,632stderr