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 3, 2021 15:20Mikhail ShirokovMikhail ShirokovScore: 25,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2021 15:1825,112266,020,279205,915,91502,244,608
2Aug 3, 2021 15:2025,375269,184,828208,076,25202,248,704
3Aug 3, 2021 15:1825,432270,453,345208,543,71202,256,896
4Aug 3, 2021 15:1825,704276,404,124210,769,61002,260,992
5Aug 3, 2021 15:2025,776276,332,581211,366,90902,240,512
6Aug 3, 2021 15:2025,959282,155,753212,865,99302,244,608