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 listJul 11, 2025 08:50Valentin KofmanValentin KofmanScore: 6,840Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 11, 2025 08:506,83083,916,61738,003,00018,001,0002,494,464
2Jul 11, 2025 08:506,84084,353,81839,061,00017,026,0002,506,752
3Jul 11, 2025 08:507,95188,386,77944,133,00021,063,0002,523,136