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 23:03Tomislav TunkovicTomislav TunkovicScore: 2,739Success
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 23:042,73030,892,07821,272,0001,122,0002,113,536
2Aug 14, 2026 23:042,73230,890,39821,282,0001,124,0002,113,536
3Aug 14, 2026 23:042,73731,474,30621,323,0001,122,0002,113,536
4Aug 14, 2026 23:042,73930,955,55121,338,0001,124,0002,113,536
5Aug 14, 2026 23:042,73930,706,25921,320,0001,145,0002,113,536
6Aug 14, 2026 23:042,74531,006,40021,380,0001,132,0002,113,536
7Aug 14, 2026 23:042,74531,282,00421,391,0001,121,0002,113,536
8Aug 14, 2026 23:042,74630,996,16021,392,0001,127,0002,113,536
9Aug 14, 2026 23:042,79335,739,89921,777,0001,133,0002,113,536