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 1, 2026 20:08Mehdi-Dehghan-FooladiMehdi-Dehghan-FooladiError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 20:090281,840,053258,796,0002,997,0002,523,136expected "2142698272 ", got "2142699520 "
2May 1, 2026 20:090289,042,570264,391,0002,002,0002,523,136expected "2069852778 ", got "2069823488 "
3May 1, 2026 20:090288,727,481263,291,0002,002,0002,527,232expected "2204345423 ", got "2204303360 "