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 27, 2025 16:53Oleg KovalovOleg KovalovScore: 85,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 27, 2025 16:5377,168660,866,124492,827,000139,951,0002,355,200
2Jan 27, 2025 16:5385,831727,463,493562,851,000140,962,0002,265,088
3Jan 27, 2025 16:53103,629880,079,890711,799,000137,961,0002,453,504