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 17, 2023 23:33Ulyanov AlekseyUlyanov AlekseyScore: 17,701Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2023 23:3417,672214,855,112144,907,28202,252,800
2Jun 17, 2023 23:3417,674199,548,496144,929,55302,248,704
3Jun 17, 2023 23:3217,676197,435,455144,943,99602,248,704
4Jun 17, 2023 23:3317,681229,812,274144,986,60302,252,800
5Jun 17, 2023 23:3217,701216,314,031145,149,60002,240,512
6Jun 17, 2023 23:3217,712214,430,845145,240,85602,244,608
7Jun 17, 2023 23:3317,716210,389,922145,272,02702,248,704
8Jun 17, 2023 23:3417,780200,927,983145,798,57402,248,704
9Jun 17, 2023 23:3317,789223,010,703145,870,62302,256,896