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 16, 2023 21:25Yuriy LyfenkoYuriy LyfenkoScore: 6,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 21:256,622622,059,80454,300,88802,220,032
2Jul 16, 2023 21:256,689611,757,68154,850,44302,224,128
3Jul 16, 2023 21:256,832611,851,27156,021,18702,293,760