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 listSep 19, 2026 15:37Andrew EpsteinAndrew EpsteinScore: 25,131Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 15:3824,916214,885,784202,304,0002,013,0002,117,632stderr
2Sep 19, 2026 15:3824,971215,900,129201,736,0003,027,0002,117,632stderr
3Sep 19, 2026 15:3825,037217,661,131203,295,0002,011,0002,117,632stderr
4Sep 19, 2026 15:3825,046215,809,516202,369,0003,013,0002,117,632stderr
5Sep 19, 2026 15:3825,131217,143,730203,036,0003,039,0002,117,632stderr
6Sep 19, 2026 15:3825,138216,599,410203,079,0003,056,0002,117,632stderr
7Sep 19, 2026 15:3825,222217,231,872203,755,0003,067,0002,117,632stderr
8Sep 19, 2026 15:3825,311218,679,226204,459,0003,092,0002,117,632stderr
9Sep 19, 2026 15:3825,437219,269,973205,461,0003,125,0002,117,632stderr