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 29, 2026 13:05Victor MerckléVictor MerckléScore: 2,756Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 13:062,71930,422,64421,212,0001,090,0002,117,632stderr
2Aug 29, 2026 13:062,73030,495,42321,292,0001,095,0002,117,632stderr
3Aug 29, 2026 13:062,74730,705,09021,512,0001,019,0002,117,632stderr
4Aug 29, 2026 13:062,75330,727,70321,570,0001,011,0002,117,632stderr
5Aug 29, 2026 13:062,75631,037,53021,431,0001,174,0002,117,632stderr
6Aug 29, 2026 13:062,76432,226,82321,517,0001,153,0002,117,632stderr
7Aug 29, 2026 13:065,38352,286,76543,115,0001,027,0002,117,632stderr
8Aug 29, 2026 13:065,39152,358,41643,009,0001,201,0002,117,632stderr
9Aug 29, 2026 13:0614,215124,705,151115,474,0001,090,0002,117,632stderr