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 17, 2026 10:33Tomislav TunkovicTomislav TunkovicScore: 2,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 10:412,92933,788,53522,882,0001,142,0002,129,920
2Aug 17, 2026 10:412,94634,258,64223,015,0001,145,0002,129,920
3Aug 17, 2026 10:412,95934,052,99723,116,0001,148,0002,129,920
4Aug 17, 2026 10:412,96534,395,41823,181,0001,139,0002,129,920
5Aug 17, 2026 10:412,96834,143,13423,206,0001,139,0002,129,920
6Aug 17, 2026 10:413,00434,455,42823,494,0001,143,0002,129,920
7Aug 17, 2026 10:413,02434,526,83423,648,0001,151,0002,129,920
8Aug 17, 2026 10:413,07157,453,80522,997,0002,192,0002,129,920
9Aug 17, 2026 10:417,62772,650,88461,434,0001,115,0002,129,920