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 listApr 27, 2026 20:48Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 20:49069,110,861050,166,0002,379,776Exit with code 1: probe_v=input_size_1 stdin_regular=1 st_size=400000000 fstat_errno=0 probe_v=input_size_1 stdin_regular=1 st_size=400000000 bytes_read=400000000 read_calls=97 eof_seen=1 elapsed_ms=48 first_read_ms=1 max_read_ms=1 mb_per_s_x1000=78408...stderr