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 listAug 21, 2024 13:59GabriellaGabriellaScore: 274,871Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2024 13:59274,6182,318,436,2122,251,864,03202,289,664
2Aug 21, 2024 13:59274,8712,307,938,8042,253,939,19302,297,856
3Aug 21, 2024 13:59275,0792,341,172,8472,255,649,90402,293,760