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 14, 2026 20:23Tomislav TunkovicTomislav TunkovicScore: 10,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 20:3310,80797,241,39987,611,0001,009,0002,121,728stderr
2Aug 14, 2026 20:3310,82797,220,68187,776,0001,011,0002,121,728stderr
3Aug 14, 2026 20:3310,83499,370,70987,832,0001,009,0002,121,728stderr
4Aug 14, 2026 20:3310,85298,177,98387,978,0001,012,0002,121,728stderr
5Aug 14, 2026 20:3310,85398,134,94087,990,0001,011,0002,121,728stderr
6Aug 14, 2026 20:3310,85497,575,34687,997,0001,011,0002,121,728stderr
7Aug 14, 2026 20:3310,87397,670,24088,158,0001,008,0002,121,728stderr
8Aug 14, 2026 20:3310,88398,396,49688,237,0001,007,0002,121,728stderr
9Aug 14, 2026 20:3310,92297,979,44088,558,0001,009,0002,121,728stderr