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 22, 2025 22:41Oleg KovalovOleg KovalovScore: 315,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 22:41311,4912,585,166,1582,363,431,000190,792,0002,310,144
2Jan 22, 2025 22:41315,9462,616,105,0252,403,920,000186,838,0002,428,928
3Jan 22, 2025 22:41324,3092,686,275,5642,472,523,000186,812,0002,310,144