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 listJan 29, 2026 20:44lipapipalipapipaScore: 26,550Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2026 20:4426,183239,257,208212,703,0001,997,0002,281,472
2Jan 29, 2026 20:4426,550243,818,890215,710,0001,997,0002,277,376
3Jan 29, 2026 20:4426,580250,355,497214,958,0002,999,0002,273,280