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 07:04Sergey StreminSergey StreminScore: 58,948Success
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 07:0457,343544,038,996470,216,39002,240,512
2Jun 13, 2021 07:0458,948549,265,752483,374,82702,260,992
3Jun 13, 2021 07:0460,545562,656,481496,467,69002,244,608