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 listMar 18, 2026 04:00limanjun99limanjun99Score: 119,090Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 04:0089,931765,015,850602,537,000134,896,0002,363,392
2Mar 18, 2026 04:00119,0901,008,027,927843,598,000132,936,0002,281,472
3Mar 18, 2026 04:00151,6501,271,889,5621,108,692,000134,840,0002,310,144