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 14, 2023 00:53Paul MasurelPaul MasurelScore: 18,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2023 00:5318,352210,779,740150,483,74302,293,760
2Jul 14, 2023 00:5318,414223,532,205150,995,84802,310,144
3Jul 14, 2023 00:5318,495218,830,751151,660,70802,199,552