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 listJun 16, 2026 15:30Maya RebholzMaya RebholzError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 15:310610,029,828563,265,00037,137,0002,125,824expected "2104664504 ", got "2147428189 "
2Jun 16, 2026 15:310607,631,021559,194,00039,069,0002,125,824expected "2138454174 ", got "-2147192189 "
3Jun 16, 2026 15:310603,531,604555,051,00039,203,0002,125,824expected "2151163692 ", got "2147444189 "