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 listApr 25, 2023 20:50Franek KortaFranek KortaScore: 12,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2023 21:4711,415154,923,27893,602,39202,260,992
2May 6, 2023 21:4712,079155,289,31299,051,47402,195,456
3May 6, 2023 21:4712,424154,216,024101,876,56002,203,648
4Apr 25, 2023 20:5012,632169,404,116103,580,10702,191,360
5Apr 25, 2023 20:5012,718168,620,756104,284,00302,301,952
6Apr 25, 2023 20:5012,891164,935,625105,708,17502,244,608