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 15, 2023 06:36Paul MasurelPaul MasurelScore: 26,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2023 06:3626,041279,591,369213,538,07702,301,952
2Jul 15, 2023 06:3626,691284,096,644218,862,83602,187,264
3Jul 15, 2023 06:3627,276290,765,596223,662,98602,228,224