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 23, 2024 16:38AnSaAnSaScore: 983,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2024 16:38974,7338,058,240,4967,992,813,50802,289,664
2Jan 23, 2024 16:38983,8468,137,338,6728,067,534,99102,301,952
3Jan 23, 2024 16:38986,9018,147,568,5818,092,585,20602,301,952