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 12, 2023 14:25Paul MasurelPaul MasurelScore: 16,696Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 14:2516,667197,823,926136,671,97302,199,552
2Jul 12, 2023 14:2516,696200,574,047136,903,31802,310,144
3Jul 12, 2023 14:2516,747205,522,777137,322,84002,310,144