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 listAug 31, 2021 16:27Jules MinierJules MinierScore: 954,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2021 16:27954,4607,897,802,8397,826,570,38102,301,952
2Aug 31, 2021 16:27954,7467,889,184,4907,828,918,52202,297,856
3Aug 31, 2021 16:27963,2157,974,992,9987,898,362,96302,293,760