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 2, 2026 12:39Pavel SkripkinPavel SkripkinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 2, 2026 12:40092,691,34871,865,0002,994,0002,363,392expected "2249078646 ", got " "stderr
2May 2, 2026 12:40091,298,50573,443,0001,006,0002,465,792expected "2031807579 ", got " "stderr
3May 2, 2026 12:40087,648,51271,040,0004,002,0002,527,232expected "2200322381 ", got " "stderr