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 listApr 21, 2026 00:45Taylor DettlingTaylor DettlingError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 00:45066,699,84233,339,00014,143,0002,490,368expected "2099428627 ", got "0 "
2Apr 21, 2026 00:45072,662,59732,420,00015,197,0002,490,368expected "2086633493 ", got "0 "
3Apr 21, 2026 00:45060,716,60931,094,00017,051,0002,371,584expected "2138279300 ", got "0 "