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:37Paul MasurelPaul MasurelScore: 26,043Success
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:3725,876279,672,511212,183,65802,306,048
2Jul 15, 2023 06:3726,043269,402,155213,550,56202,273,280
3Jul 15, 2023 06:3726,075283,909,289213,816,39702,306,048