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 listApr 19, 2024 10:35Joad NacerJoad NacerScore: 1,006,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2024 10:351,003,6148,287,526,3648,229,631,46702,293,760
2Apr 19, 2024 10:351,006,9328,330,891,9348,256,845,32202,297,856
3Apr 19, 2024 10:351,017,0448,394,294,6248,339,758,15002,289,664