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 10, 2025 07:10Ian MckibbenIan MckibbenScore: 75,529Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2025 07:1074,670647,915,500592,319,00019,977,0002,396,160
2Jan 10, 2025 07:1075,529644,066,274600,357,00018,979,0002,379,776
3Jan 10, 2025 07:1076,792661,539,255610,706,00018,990,0002,310,144