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 listJan 13, 2024 02:13cashkarucashkaruScore: 125,096Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2024 02:13120,4551,048,112,172987,734,23702,174,976
2Jan 13, 2024 02:13125,0961,091,384,0341,025,787,50802,289,664
3Jan 13, 2024 02:13125,7611,100,866,5281,031,241,44202,306,048