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 09:26Valentin KofmanValentin KofmanScore: 6,959Success
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 09:266,74077,850,56642,202,00013,062,0002,490,368
2Jul 11, 2025 09:266,95981,661,99645,049,00012,013,0002,338,816
3Jul 11, 2025 09:267,18982,975,61234,968,00023,978,0002,334,720