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 listMay 7, 2024 13:21dpetruciidpetruciiScore: 1,491,175Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2024 13:211,471,90412,143,338,23812,069,610,43002,220,032
2May 7, 2024 13:211,491,17512,299,058,73012,227,636,87002,207,744
3May 7, 2024 13:211,493,24912,309,404,33312,244,643,70802,211,840