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 listSep 1, 2026 14:31Victor MerckléVictor MerckléScore: 2,627Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 14:322,61729,822,58320,443,0001,024,0002,117,632stderr
2Sep 1, 2026 14:322,61930,511,77320,454,0001,027,0002,117,632stderr
3Sep 1, 2026 14:322,62629,917,59820,486,0001,053,0002,117,632stderr
4Sep 1, 2026 14:322,62629,749,24120,487,0001,047,0002,117,632stderr
5Sep 1, 2026 14:322,62729,941,59520,532,0001,017,0002,117,632stderr
6Sep 1, 2026 14:322,62929,734,52120,538,0001,021,0002,117,632stderr
7Sep 1, 2026 14:325,24851,375,88541,885,0001,155,0002,117,632stderr
8Sep 1, 2026 14:325,28351,639,51742,169,0001,158,0002,117,632stderr
9Sep 1, 2026 14:325,28551,457,70142,073,0001,271,0002,117,632stderr