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 listJun 13, 2021 09:11Yurkov AlekseyYurkov AlekseyScore: 102,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 10:5686,878773,971,986712,401,39602,289,664
2Jun 13, 2021 09:1193,074842,362,334763,207,27502,289,664
3Jun 13, 2021 10:5696,337853,227,017789,961,17802,285,568
4Jun 13, 2021 09:11102,619904,760,723841,479,45602,281,472
5Jun 13, 2021 09:11103,819922,136,724851,315,37902,285,568
6Jun 13, 2021 10:56115,8801,004,305,543950,213,64602,277,376