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 10:01Victor MerckléVictor MerckléScore: 3,013Success
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 10:022,90232,007,65422,730,0001,072,0002,117,632stderr
2Aug 19, 2026 10:022,92332,222,49022,941,0001,028,0002,117,632stderr
3Aug 19, 2026 10:022,93132,279,33622,967,0001,070,0002,117,632stderr
4Aug 19, 2026 10:022,94632,464,15123,135,0001,026,0002,117,632stderr
5Aug 19, 2026 10:023,01332,866,55123,638,0001,073,0002,117,632stderr
6Aug 19, 2026 10:023,02232,897,36223,739,0001,047,0002,117,632stderr
7Aug 19, 2026 10:025,59353,999,20644,845,0001,023,0002,117,632stderr
8Aug 19, 2026 10:025,65154,622,05945,321,0001,022,0002,117,632stderr
9Aug 19, 2026 10:025,71354,992,21044,790,0002,060,0002,117,632stderr