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 17:01Mehdi-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 17:020284,838,807264,648,0002,996,0002,527,232expected "2188034814 ", got "1346 "
2May 1, 2026 17:020282,733,008262,863,0003,997,0002,318,336expected "2119290669 ", got "1277 "
3May 1, 2026 17:020272,472,379255,383,0002,003,0002,338,816expected "2113631276 ", got "1288 "