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 listMay 20, 2026 18:59M-RochatM-RochatError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 18:59010,689,80301,575,0002,121,728expected "2032822238 ", got "2118071621 "
2May 20, 2026 18:59013,232,8821,479,00002,121,728expected "2139972161 ", got "2118071621 "
3May 20, 2026 18:59010,502,8041,448,00002,121,728expected "1994427714 ", got "2118071621 "