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 listMar 1, 2025 02:31KeefeKeefeScore: 143,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 1, 2025 02:31141,3551,923,735,424745,567,000413,541,0002,523,136
2Mar 1, 2025 02:31143,1731,923,504,560747,833,000426,184,0002,482,176
3Mar 1, 2025 02:31145,6342,014,554,407774,075,000420,126,0002,527,232