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:54Tomislav TunkovicTomislav TunkovicScore: 2,828Success
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 21:052,80331,529,92421,864,0001,128,0002,113,536
2Aug 14, 2026 21:052,80632,779,80321,971,0001,039,0002,113,536
3Aug 14, 2026 21:052,81231,585,26821,931,0001,133,0002,113,536
4Aug 14, 2026 21:052,81431,586,48121,942,0001,135,0002,113,536
5Aug 14, 2026 21:052,82831,704,38022,064,0001,128,0002,113,536
6Aug 14, 2026 21:052,83431,756,43522,196,0001,043,0002,113,536
7Aug 14, 2026 21:052,83432,280,25222,105,0001,139,0002,113,536
8Aug 14, 2026 21:052,83531,786,45722,125,0001,125,0002,113,536
9Aug 14, 2026 21:052,83933,084,83622,247,0001,039,0002,113,536