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 00:20Paul MasurelPaul MasurelScore: 16,518Success
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 00:2016,465202,410,605135,008,97402,207,744
2Jul 15, 2023 00:2016,518191,660,121135,447,10302,199,552
3Jul 15, 2023 00:2016,650196,018,779136,530,13002,256,896