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 listDec 8, 2024 23:51Hayden DonnellyHayden DonnellyScore: 972,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2024 23:51966,5557,956,701,0377,735,902,000189,850,0002,269,184
2Dec 8, 2024 23:51972,9938,003,374,0727,783,674,000194,866,0002,269,184
3Dec 8, 2024 23:51974,1608,019,208,4887,792,235,000195,880,0002,269,184