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 11:59Paul MasurelPaul MasurelScore: 36,871Success
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 11:5936,596365,147,915300,088,52802,207,744
2Jul 12, 2023 11:5936,871366,023,277302,344,60602,215,936
3Jul 12, 2023 11:5936,985372,702,882303,278,42102,199,552