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 13, 2023 09:17gchebanovgchebanovScore: 1,040,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2023 09:171,037,7878,571,518,7418,509,855,79502,281,472
2Jul 13, 2023 09:171,040,2578,593,717,2238,530,110,19702,289,664
3Jul 13, 2023 09:171,044,1638,640,441,6938,562,138,79702,285,568