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 05:05Paul MasurelPaul MasurelScore: 12,249Success
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 05:0511,948156,180,35897,972,49802,240,512
2Jul 13, 2023 05:0512,249171,416,889100,441,43202,310,144
3Jul 13, 2023 05:0512,327166,246,141101,079,74402,289,664