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 19:00Tomislav TunkovicTomislav TunkovicScore: 31,289Success
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 19:2730,191256,035,036246,540,0001,033,0002,121,728stderr
2Aug 14, 2026 19:2731,289265,712,243255,335,0001,238,0002,121,728stderr
3Aug 14, 2026 19:2731,824270,039,737259,731,0001,233,0002,121,728stderr